cgal/Boolean_set_operations_2/include/CGAL
Ron Wein 403cf9d75c Improved the divide-and-conquer algorithm for aggregated operations,
so that we use merge sort instead of O(n log(n)) sort. (with Baruch)
2006-02-19 13:10:16 +00:00
..
Boolean_set_operations_2 Improved the divide-and-conquer algorithm for aggregated operations, 2006-02-19 13:10:16 +00:00
IO Change CVS keywords to SVN style 2006-02-16 14:30:13 +00:00
Boolean_set_operations_2.h Change CVS keywords to SVN style 2006-02-16 14:30:13 +00:00
General_polygon_2.h Change CVS keywords to SVN style 2006-02-16 14:30:13 +00:00
General_polygon_set_2.h Improved the divide-and-conquer algorithm for aggregated operations, 2006-02-19 13:10:16 +00:00
General_polygon_with_holes_2.h Change CVS keywords to SVN style 2006-02-16 14:30:13 +00:00
Gps_circle_segment_traits_2.h Change CVS keywords to SVN style 2006-02-16 14:30:13 +00:00
Gps_segment_traits_2.h Change CVS keywords to SVN style 2006-02-16 14:30:13 +00:00
Gps_traits_2.h Change CVS keywords to SVN style 2006-02-14 10:08:15 +00:00
Polygon_set_2.h Change CVS keywords to SVN style 2006-02-16 14:30:13 +00:00
Polygon_with_holes_2.h Change CVS keywords to SVN style 2006-02-16 14:30:13 +00:00