The public CGAL repository, see the README below

algorithmsarrangeboolean-operationsc-plus-pluscgalcomputational-geometrycppgeometrygeometry-processinglibrarymesh-processingmeshespoint-cloudpolygontemplate-librarytriangulationvoronoi-diagram

Menelaos Karavelas 1f2d2aba4c various changes: ... 1. removed macros USE_KERNEL_PREDICATES, USE_BF, USE_MAP, USE_VECTOR, USE_INIT, USE_SET and USE_INPLACE_EDGE_LIST 2. number_of* methods return size_type 3. added the following predicates for sites: Compare_x_2, Compare_y_2 and Orientation_2 4. The second template parameter of the Segment_Voronoi_diagram_2 class no longer defaults to Point_container, but rather to std::list; the std::list is then wrapped to give the intented functionality; the concept of PC is: back-insertion sequence with non-mutable iterators 5. The (advanced) user can (sort of) choose what kind of map goes into the edge list; by default this is an STL map, but by changing the last template parameter the map switches to CGAL's Unique_hash_map 6. The (advanced) user can switch between optimizing speed and space by switching the last template parameter of the Segment_Voronoi_diagram_2 class; optimization with respect to speed implies the need for an in-place edge list but that approximately doubles the space requirements; optimization with respect to space means about 5% decrease in speed but much less memory and a simpler interface for the Segment_Voronoi diagram_face_base_2 class (in fact in this case the standard Triangulation_face_base_2 class will work as is). 7. removed unused typedef Face_face_map		2004-02-11 00:08:09 +00:00
Extension_Packages	*** empty log message ***	2004-02-01 21:32:16 +00:00
Old_Packages	Bump for 3.103 ( 7 Jan 2003)	2003-01-07 15:45:48 +00:00
Packages	various changes:	2004-02-11 00:08:09 +00:00
.gitattributes	added the initial version for the reference manual	2004-02-09 16:14:31 +00:00
.gitignore	fix .cvsignore files	2003-12-07 20:24:05 +00:00