CGAL users discussion list

[Dragan Vidovic <>]

Thank you for your answer Sebastien. I need a triangulation in order to use
the query functions on a sphere. I need to find out if one point belongs to
a triangle on the sphere, who's edges are arcs. Actually, I need this
because I need to find out if a vector connecting that point to the centre
of the sphere can be represented as a convex combination of vectors
connecting the triangle vertices with the sphere centre. Moreover, I need to
search such triangulation until I find a triangle (or a vector triplet) that
satisfies this condition. The dynamic_hull_3.cpp code copies the boundary of
a convex hull into a polyhedron, but none of these two structures seem to be
searchable in this way. On the other hand, I'm not at all familiar with
regular triangulations, but the paper that you mention seems like what I
need. Before I dive into the world of regular triangulations, can you please
confirm that such structure can be used for my search?

The paper mentions that CGAL needs to be modified in order to use the method
proposed there. I suppose that these modifications are in the CGAL
distribution by now?

--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Triangulation-of-a-sphere-tp4404518p4404642.html
Sent from the cgal-discuss mailing list archive at Nabble.com.