1. replaced {Vertex,Face}_handle(NULL) by {Vertex,Face}_handle()
2. added a site and the corresponding storage site that store only
up to 2 points; these sites are ideal when we do not support
intersecting segments (the additional 6 points are no longer needed).
This helps optimizing the memory usage.
3. added a tag in the traits class that indicates whether or not
to support intersecting segments; if intersecting segments are not
supported the simple versions of the site and storage site are used
automatically; the vertex base class was modified in order to
support this choice; also the algorithm in the case of intersecting
segments was modified (if intersections exist we do not add the
new segment); the algorithm uses the tag from the traits to identify
this case.
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
=> SNC_explorer.h has become redundant
in order to make the test suite (function point_location_SM() ) work
with the new exloration API, the SNC_SM_point_locator has been adjusted.
It now inherits from template<SM_decorator>, i.e. a SNC_SM_decorator or
an SNC_SM_const_decorator. SNC_decorator_[const_]traits are used to
either return handles or const_handles.