Subject: CGAL users discussion list
List archive
- From: vimarsh <>
- To:
- Subject: [cgal-discuss] Constrained Delaunay Triangulation, giving maximum area limit
- Date: Tue, 27 Oct 2015 20:18:08 -0700 (PDT)
- Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=SoftFail ; spf=None
- Ironport-phdr: 9a23:Y9EYnx815oFiSv9uRHKM819IXTAuvvDOBiVQ1KB91uocTK2v8tzYMVDF4r011RmSDdidsq4P1LWempujcFJDyK7JiGoFfp1IWk1NouQttCtkPvS4D1bmJuXhdS0wEZcKflZk+3amLRodQ56mNBXsq3G/pQQfBg/4fVIsYL+lR8iL04/oiKibwN76XUZhvHKFe7R8LRG7/036l/I9ps9cEJs30QbDuXBSeu5blitCLFOXmAvgtI/rpMYwuxJ54KxwspcYGeWhJ/x5HvRkC2EtPGkxocHqrhLeVhCn530GU2xQnAAbLRLC6UTkX5L4qDD6/r5j2SyTJ9b2C7scVjGr7qMtQxjt3nRUfwUl+X3a35UjxJlQpwis8kcnm4M=
Hi,
I am trying to get a constrained delaunay triangulation of a closed 2d set
of segments, so i'm planning to start with a polygon, and insert as
constraints the segments inside, but i wanted to put a limit on the maximum
area
of the triangles formed, or if not possible maybe a limit of maximum edge
length of the triangles as i want to get a lot of triangles (therefore cgal
will have to insert its own additional vertices) since i want to use the
final vertices as sample points later on.
I have looked through member functions and classes, but could not find
something similar
Could anyone suggest how i could do this?
Thankyou
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Constrained-Delaunay-Triangulation-giving-maximum-area-limit-tp4661282.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- [cgal-discuss] Constrained Delaunay Triangulation, giving maximum area limit, vimarsh, 10/28/2015
- Re: [cgal-discuss] Constrained Delaunay Triangulation, giving maximum area limit, Olivier Devillers, 10/28/2015
Archive powered by MHonArc 2.6.18.