Subject: CGAL users discussion list
List archive
- From: Kim <>
- To:
- Subject: [cgal-discuss] boolean union of rectlinear polygons ,which kernel?
- Date: Fri, 12 Jun 2009 00:45:45 +0200
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:sender:date:x-google-sender-auth:message-id:subject :from:to:content-type:content-transfer-encoding; b=xTM1ILDGZTjMZq0+MoRk0x/gKZw1aO20x9JK9w6DUxXLfz8cwtEzaKHcEV6oU4CNI/ 0oqe1T88s2t1JMgMOvG0kEN5rS6zoxtrhBqmjL8e90brSAlpMDEEgqy0HjylPCC7MlCw iL6263AhTpXItD2yAFq27M8U0RVSzONgNSxas=
Hi
I have a lot of rectlinear 2D polygons which I would like to join .
All numbers are in integer.
I have a test running with 2000 polygons (each can have op 1000's
vertices) takes 2 min. (debug mode )
typedef CGAL::Gmpq Base_nt;
typedef CGAL::Lazy_exact_nt<Base_nt> Coord_type;
struct Kernel : public CGAL::Cartesian<Coord_type> {};
typedef CGAL::Gps_circle_segment_traits_2<Kernel> Traits;
I know above is for circles , so
Which kernel and numbertype would give me best speed when I only have
rectlinear polygons.
Best regards
Kim
- [cgal-discuss] boolean union of rectlinear polygons ,which kernel?, Kim, 06/12/2009
Archive powered by MHonArc 2.6.16.