CGAL users discussion list

[François Becker <>]

On Wed, Jul 25, 2012 at 8:31 AM, Sebastien Loriot (GeometryFactory) <> wrote:

On 07/20/2012 02:47 PM, fbecker wrote:

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?

I'm afraid we have no tool to do that for now. We have a package under
development that I hope should be usable with the constrained triangulation package.

Sebastien.

Thanks for your answer, Sebastien.

In the meantime I have developed my own (non efficient, but effective) algorithm (without CGAL) to resolved this problem; however this is private R&D, so I'm not authorized (yet?) to release it. I'll keep you informed about that.

All the best