CGAL users discussion list

[colonel_panic <>]

Hello,

I am trying to use Delaunay_triangulation_3 to generate a triangulation of a
set of points and then use some properties of the resulting simplices.  The
circumscribing circle/sphere of each triangle/tetrahedron must be empty and
there are some predicate functions to assess whether that condition is
fulfilled (eg DelaunayTriangulationTraits_3::Side_of_oriented_sphere_3 ).  
Is there an easy way to ascertain data about the sphere in question using
Delaunay_triangulation_3  eg its radius?  if not, does CGAL provide other
functions which can be used to calculate the radius of the circumscribing
sphere, when given the tetrahedron?  

Thanks, Angus




--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Properties-of-polytopes-in-Delaunay-triangulation-tp4659393.html
Sent from the cgal-discuss mailing list archive at Nabble.com.