CGAL users discussion list

["Laurent Rineau (GeometryFactory)" <>]

On Thursday 18 March 2010 20:10:13 Ramin H wrote:
> I believe CGAL's triangulation data structure uses weighted points.

CGAL triangulation data structures do not use points at all, but only 
vertices. Exactly it uses objects whose class must be a model of the 
following 
concept:
http://www.cgal.org/Manual/last/doc_html/cgal_manual/TDS_2_ref/Concept_TriangulationDataStructure_2--
Vertex.html

Optionally, there can be a Point type in that Vertex concept. For Delaunay 
triangulation, that point type can be a regular Kernel::Point_2 type. For 
*regular* triangulations, them the point type is required to be a weighted 
point type.

-- 
Laurent Rineau, PhD
R&D Engineer at GeometryFactory           http://www.geometryfactory.com/
Release Manager of the CGAL Project       http://www.cgal.org/