Subject: CGAL users discussion list
List archive
- From: Remi <>
- To:
- Subject: Re: [cgal-discuss] triangulating Polygon_with_holes_2
- Date: Sun, 24 Jan 2010 22:03:27 +0100
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :content-type; b=murL/GSrFOk4V/nn3TiB+lGNBKHdW6qgLhN/WJ7o3hladdfFArHrh+j0PfFyf0E1kR jt5AXpP3o3W5dgUMpThL2QWmsrMDudc6c8N8phkbfbRNLl7HayoqMMfKPojYUlqVBZic Z5nZWWA6dspHrmFoYJLqU2d4pMuBolkm8V2Og=
"Best" would be a method of Polygon_with_holes_2 that outputs a list
of Polygon_2 objects that represent convex partitioning of
Polygon_with_holes_2. And that partitioning should use the most
efficient algorithm known and shouldn't produce any additional points.
Thank you for info. If there is no better way then I'm fairly
disappointed by CGAL.
- [cgal-discuss] triangulating Polygon_with_holes_2, Remi, 01/23/2010
- Re: [cgal-discuss] triangulating Polygon_with_holes_2, efif, 01/23/2010
- Re: [cgal-discuss] triangulating Polygon_with_holes_2, Remi, 01/24/2010
- Re: [cgal-discuss] triangulating Polygon_with_holes_2, Mariette Yvinec, 01/25/2010
- Re: [cgal-discuss] triangulating Polygon_with_holes_2, efif, 01/23/2010
Archive powered by MHonArc 2.6.16.