CGAL users discussion list

[fbecker <>]

Hi,

I have got 3D points which are located on the unit sphere. I want to
triangulate these points in a Delaunay fashion; using a convex hull
algorithm perfectly fits this problem.

Now, I want to define a subset of these points as constrained polygons in
the triangulation (without enclosing other points in the surface projected
on the unit sphere).

If a set of triangles replaced by the polygon already exist in the convex
hull, no problem. Otherwise, how can it be done?

Thanks




--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Constrained-Delaunay-on-the-sphere-tp4655501.html
Sent from the cgal-discuss mailing list archive at Nabble.com.