-
+
@@ -107,6 +107,27 @@ David A. Wheeler's 'SLOCCount', restricted to the include/CGAL/
Release date:
+ Installation
+
+
3D Fast Intersection and Distance Computation
- Update requirements of the concepts
AABBTraits and AABBGeomTraits to match the implementation of the package.
@@ -137,7 +158,7 @@ David A. Wheeler's 'SLOCCount', restricted to the include/CGAL/
- Add a constructor for
Regular_triangulation_2 and Delaunay_triangulation_2 from a range of points or a range of points with info.
-
+
Release 4.1
@@ -163,7 +184,7 @@ David A. Wheeler's 'SLOCCount', restricted to the include/CGAL/
trapezoidal decomposition point-location strategy. The new
implementation enables point location in unbounded arrangements. It
constructs a search structure of guaranteed linear size with
- guaranteed logarithmic query time.
+ guaranteed logarithmic query time.
@@ -267,7 +288,7 @@ the following has been changed since CGAL-4.0:
Surface Mesh Parameterization
- Fix a memory leak.
-- Fix a compatibility issue with Eigen-3.1 of
Eigen_solver_traits. This fix also affects the usage of
+ - Fix a compatibility issue with Eigen-3.1 of
Eigen_solver_traits. This fix also affects the usage of
that class in the package Surface Reconstruction from Point Sets.
@@ -289,8 +310,8 @@ CGAL 4.0 offers the following improvements and new functionality :
CGAL.
The CGAL project, driven by the CGAL Editorial Board, has decided to
- change the license scheme of CGAL. We increased the major number
- of the CGAL version to '4' in order to reflect this license change.
+ change the license scheme of CGAL. We increased the major number
+ of the CGAL version to '4' in order to reflect this license change.
The CGAL-4.x series is released under:
- LGPLv3+ (that is LGPL "either version 3 of the License, or (at your
@@ -333,7 +354,7 @@ CGAL 4.0 offers the following improvements and new functionality :
cells of the object plus the incidence and adjacency relations
between cells. Geometry is added to combinatorial maps simply by
associating a point to each vertex of the map. This data
- structure can be seen as the generalization in dD of the
+ structure can be seen as the generalization in dD of the
Polyhedron_3.
@@ -352,7 +373,7 @@ CGAL 4.0 offers the following improvements and new functionality :
AABB Tree
- Document constness of member functions of the
AABB_tree class.
- - The class
AABB_tree is now guaranteed to be read-only thread-safe. As usual in CGAL,
+ - The class
AABB_tree is now guaranteed to be read-only thread-safe. As usual in CGAL,
this small overhead introduced for thread-safety can be deactivated by defining CGAL_HAS_NO_THREADS.
@@ -361,7 +382,7 @@ CGAL 4.0 offers the following improvements and new functionality :
Add an extra template parameter to the class Alpha_shape_2 that allows a certified construction using
a traits class with exact predicates and inexact constructions.
An object of type Alpha_shape_2 can now be constructed from a triangulation.
-
+
3D Alpha Shapes
@@ -386,10 +407,10 @@ CGAL 4.0 offers the following improvements and new functionality :
The const-correctness of this package have been worked out. The transition for users should be smooth in
general, however adding few const in user code might be needed in some cases.
- The class Kd_tree is now guaranteed to be read-only thread-safe. As usual in CGAL,
- this small overhead introduced for thread-safety can be deactivated by defining CGAL_HAS_NO_THREADS.
+ The class Kd_tree is now guaranteed to be read-only thread-safe. As usual in CGAL,
+ this small overhead introduced for thread-safety can be deactivated by defining CGAL_HAS_NO_THREADS.
Bug-fix in Orthogonal_incremental_neighbor_search and Incremental_neighbor_search classes. Several calls to begin()
- now allow to make several nearest neighbor search queries independently.
+ now allow to make several nearest neighbor search queries independently.
STL Extension
@@ -401,7 +422,7 @@ CGAL 4.0 offers the following improvements and new functionality :
Triangulation_2
- - Fix a thread-safety issue in
Delaunay_triangulation_2 remove functions. As usual in CGAL,
+ - Fix a thread-safety issue in
Delaunay_triangulation_2 remove functions. As usual in CGAL,
the small overhead introduced for thread-safety can be deactivated by defining CGAL_HAS_NO_THREADS.
- Add extraction operator for the class
Constrained_triangulation_2 (and thus to all inheriting classes).
@@ -418,7 +439,7 @@ CGAL 3.9 offers the following improvements and new functionality :
General
- The class
Root_of_2 is now deprecated. It is recommended to use the class Sqrt_extension instead.
- - The class
Sqrt_extension is now used everywhere in CGAL where an algebraic number of degree 2 is needed.
+ - The class
Sqrt_extension is now used everywhere in CGAL where an algebraic number of degree 2 is needed.
This change has been done in the Root_of_traits mechanism (indirectly packages 2D Circular kernel and 3D Spherical kernel)
and the packages 2D Segment Delaunay Graphs and 2D Arrangements.
- Various fixes in the manual.
@@ -437,7 +458,7 @@ CGAL 3.9 offers the following improvements and new functionality :
- The quickhull implementation of CGAL (
CGAL::convex_hull_3)
has been worked out to provide very better performances.
- The function
CGAL::convex_hull_3 no longer computes the plane
- equations of the facets of the output polyhedron. However an example is
+ equations of the facets of the output polyhedron. However an example is
provided to show how to compute them easily.
- A global function
convex_hull_3_to_polyhedron_3 is now provided to extract
the convex hull of a 3D points set from a triangulation of these points.
@@ -446,12 +467,12 @@ CGAL 3.9 offers the following improvements and new functionality :
dD Spatial Searching (major new feature added)
- A traits-class and distance adapter that together with a point property map,
- allow to make nearest neighbor queries on keys instead of points have been added.
- - Few bug fixes in the documentation have revealed some inconsistencies
- that have been corrected. Two traits class concept are now documented (
RangeSearchTraits
- and SearchTraits). Most other changes concerns only classes documented as advanced.
- One issue that user can encounter is due to an additional requirement on the nested
- class Construct_cartesian_const_iterator_d defined in the concept SearchTraits that must
+ allow to make nearest neighbor queries on keys instead of points have been added.
+ - Few bug fixes in the documentation have revealed some inconsistencies
+ that have been corrected. Two traits class concept are now documented (
RangeSearchTraits
+ and SearchTraits). Most other changes concerns only classes documented as advanced.
+ One issue that user can encounter is due to an additional requirement on the nested
+ class Construct_cartesian_const_iterator_d defined in the concept SearchTraits that must
provide a nested type result_type.
@@ -460,12 +481,12 @@ CGAL 3.9 offers the following improvements and new functionality :
- General dimension is now supported.
- Hilbert sorting admits now two policies: splitting at
median or at middle (see user manual).
- - Using a property map, sorting on keys instead of points is now easier
+ - Using a property map, sorting on keys instead of points is now easier
dD Kernel
- - The d-dimensional kernel concept and models have been modified
+
- The d-dimensional kernel concept and models have been modified
to additionally provide two new functors
Less_coordinate_d and Point_dimension_d.
@@ -488,8 +509,8 @@ CGAL 3.9 offers the following improvements and new functionality :
The deprecated member function is_at_infinity() of
Arrangement_2::Vertex has been removed. It has been previously
replaced new function is_at_open_boundary().
-
- The tags in the geometry traits that indicate the type of boundary of
+
+ The tags in the geometry traits that indicate the type of boundary of
the embedding surface were replaced by the following new tags:
Left_side_category
@@ -516,7 +537,7 @@ CGAL 3.8 offers the following improvements and new functionality :
Initial support for the LLVM Clang compiler (prereleases of version 2.9).
Full support for the options -strict-ansi of the Intel Compiler 11,
and -ansi of the GNU g++ compiler.
- Adding a concept of ranges. In the following releases, it will be the
+ Adding a concept of ranges. In the following releases, it will be the
way to provide a set of objects (vs. a couple of iterators).
Fix a memory leak in CORE polynomials.
Various fixes in the manual.
@@ -532,7 +553,7 @@ CGAL 3.8 offers the following improvements and new functionality :
2D Triangulations (major new feature added)
- - Add a way to efficiently insert a range of points with information
+
- Add a way to efficiently insert a range of points with information
into a 2D Delaunay and regular triangulation.
- Add member function mirror_edge taking an edge as parameter.
- Fix an infinite loop in constrained triangulation.
@@ -542,7 +563,7 @@ CGAL 3.8 offers the following improvements and new functionality :
- Add a way to efficiently insert a range of points with information into
a 3D Delaunay and regular triangulation.
-
- Add a member function to remove a cluster of points from a Delaunay or
+
- Add a member function to remove a cluster of points from a Delaunay or
regular triangulation.
- function vertices_in_conflict is renamed vertices_on_conflict_zone_boundary
for Delaunay and regular triangulation. Function vertices_inside_conflict_zone
@@ -561,13 +582,13 @@ CGAL 3.8 offers the following improvements and new functionality :
AABB tree
- - Adding the possibility to iteratively add primitives to an existing
+
- Adding the possibility to iteratively add primitives to an existing
tree and to build it only when no further insertion is needed.
2D and 3D Kernel
- - Better handling of 2D points with elevation (3D points projected onto
+
- Better handling of 2D points with elevation (3D points projected onto
trivial planes). More general traits classes (Projection_traits_xy_3,
Projection_traits_yz_3,Projection_traits_yz_3) are provided to work with
triangulations, algorithms on polygons, alpha-shapes, convex hull algorithm...
@@ -575,14 +596,14 @@ CGAL 3.8 offers the following improvements and new functionality :
- Exact_predicates_exact_constructions_kernel now better use the static filters
which leads to performance improvements.
- Add an overload for the global function angle, taking three 3D points.
-
- In the 2D and 3D kernel concept, the constant Boolean Has_filtered_predicates
+
- In the 2D and 3D kernel concept, the constant Boolean Has_filtered_predicates
is now deprecated. It is now required to use Has_filtered_predicates_tag
(being either Tag_true or Tag_false).
- Compare_distance_2 and Compare_distance_3 provide additional operators
for 3 and 4 elements.
- Add intersection test and intersection computation capabilities
between an object of type Ray_3 and either an object of type Line_3, Segment_3 or Ray_3.
-
- Improve intersection test performance between an object of type Bbox_3 and an object of type
+
- Improve intersection test performance between an object of type Bbox_3 and an object of type
Plane_3 or Triangle_3 by avoiding arithmetic filter failures.
@@ -614,18 +635,18 @@ CGAL 3.8 offers the following improvements and new functionality :
Algebraic Foundations
- Algebraic_structure_traits now provides an Inverse functor for Fields.
- There is also a new global function inverse.
+ There is also a new global function inverse.
Bounding Volumes
- - dD Min sphere of spheres has a new traits class for the min sphere of points.
+
- dD Min sphere of spheres has a new traits class for the min sphere of points.
Triangulated Surface Mesh Simplification
- - The priority queue internally used to prioritize edge simplifications is no longer
- a relaxed heap but a binomial heap. This fix guarantees that all edges satisfying
+
- The priority queue internally used to prioritize edge simplifications is no longer
+ a relaxed heap but a binomial heap. This fix guarantees that all edges satisfying
a simplification criteria are removed (if possible).
@@ -638,12 +659,12 @@ CGAL 3.8 offers the following improvements and new functionality :
- Fix a bug in the method insert_at_vertices of the Arrangement_2 class.
- Fix several bugs in the traits class Arr_Bezier_curve_traits_2 for arrangement of Bezier curves.
-
+
2D Minkowski Sums
- A bug in the convolution method was fixed.
-
+
Release 3.7
@@ -698,7 +719,7 @@ CGAL 3.7 offers the following improvements and new functionality :
Arithmetic and Algebra
- New models Algebraic_kernel_d_1 and Algebraic_kernel_d_2 for the
- corresponding concepts. They provide generic support for various
+ corresponding concepts. They provide generic support for various
coefficient types
@@ -714,12 +735,12 @@ CGAL 3.7 offers the following improvements and new functionality :
The Delaunay and regular 2D triangulations now use a symbolic
perturbation to choose a particular triangulation in co-circular cases.
- The return type of the template member function
+ The return type of the template member function
insert(It beg, It end), taking an iterator range of points,
has been changed from int to std::ptrdiff_t.
Classes Triangulation_euclidean_traits_xy_3, Triangulation_euclidean_traits_yz_3
- and Triangulation_euclidean_traits_xz_3 are now model of the concept
+ and Triangulation_euclidean_traits_xz_3 are now model of the concept
ConstrainedTriangulationTraits_2. They can be used with and without intersection
of constraints.
@@ -732,7 +753,7 @@ CGAL 3.7 offers the following improvements and new functionality :
3D Triangulations
- - The return type of the template member function
+
- The return type of the template member function
insert(It beg, It end), taking an iterator range of points,
has been changed from int to std::ptrdiff_t.
- 3D Delaunay triangulations now provide vertex relocation by the mean
@@ -773,7 +794,7 @@ CGAL 3.7 offers the following improvements and new functionality :
- Improved performance and minor bug fix.
-
+
2D Range and Neighbor Search
- The type int in the API has been changed to std::size_t
@@ -911,7 +932,7 @@ CGAL 3.6 offers the following improvements and new functionality :
2D Regularized Boolean Set-Operations
- Fixed General_polygon_set_2::arrangement() to return the proper type
- of object.
+ of object.
@@ -942,7 +963,7 @@ CGAL 3.6 offers the following improvements and new functionality :
Fix the location of built plugins of demo/Polyhedron/, when CGAL is
configured with WITH_demos=ON
- Fix a bug in test_facet function of the incremental builder:
+ Fix a bug in test_facet function of the incremental builder:
the function did not test if while a new facet makes a vertex manifold,
no other facet incident to that vertex breaks the manifold property.
@@ -976,11 +997,11 @@ CGAL 3.6 offers the following improvements and new functionality :
- New demo: 3D periodic Lloyd algorithm.
-
- New functionality for Voronoi diagrams: dual of an edge and of a vertex,
- volume and centroid of the dual of a vertex.
+
- New functionality for Voronoi diagrams: dual of an edge and of a vertex,
+ volume and centroid of the dual of a vertex.
-
- The package can now be used with the 3D Alpha Shapes package to compute
- periodic alpha shapes.
+
- The package can now be used with the 3D Alpha Shapes package to compute
+ periodic alpha shapes.
3D Alpha shapes
@@ -988,8 +1009,8 @@ CGAL 3.6 offers the following improvements and new functionality :
- The class Weighted_alpha_shape_euclidean_traits_3 is deprecated, the class
Regular_triangulation_euclidean_traits_3 must be used instead.
-
- The package can now be used together with the 3D Periodic Triangulation
- package to compute periodic alpha shapes.
+
- The package can now be used together with the 3D Periodic Triangulation
+ package to compute periodic alpha shapes.
2D/3D Triangulations, 2D Segment Delaunay Graph, 2D Apollonius Graph,
@@ -1127,7 +1148,7 @@ This is a bug fix release.
new functions return an enumeration of a new type, namely
Arr_parameter_space.
- The tags in the geometry traits that indicate the type of boundary of
+ The tags in the geometry traits that indicate the type of boundary of
the embedding surface were replaced by the following new tags:
Arr_left_side_tag
Arr_bottom_side_tag
@@ -1256,7 +1277,7 @@ in functionality. There have also been a number of bug fixes for this release.
Qt3 based demos are still there but the documentation has been removed as the CGAL::Qt_Widget will be deprecated.
-Qt4 based demos use the Qt GraphicsView framework and the libQGLViewer.
+Qt4 based demos use the Qt GraphicsView framework and the libQGLViewer.
Installation
@@ -1274,7 +1295,7 @@ in functionality. There have also been a number of bug fixes for this release.
Modular Arithmetic (new package)
-- This package provides arithmetic over finite fields.
+
- This package provides arithmetic over finite fields.
@@ -1284,7 +1305,7 @@ in functionality. There have also been a number of bug fixes for this release.
a profiling counter enabled with CGAL_PROFILE.
- Fix of a bug in CORE/Expr.h; as a consequence, the arrangement demo works properly when handling
+ Fix of a bug in CORE/Expr.h; as a consequence, the arrangement demo works properly when handling
arrangements of conics, for example, when defining an arc with 5 points.
@@ -1293,7 +1314,7 @@ in functionality. There have also been a number of bug fixes for this release.
3D Spherical Geometry Kernel (new package)
-- This package is an extension of the linear CGAL Kernel. It offers functionalities on spheres,
+
- This package is an extension of the linear CGAL Kernel. It offers functionalities on spheres,
circles, circular arcs and line segments in the 3D space.
@@ -1358,40 +1379,40 @@ in functionality. There have also been a number of bug fixes for this release.
2D Arrangements
- - Changed the name of the arrangement package from Arrangement_2 to Arrangement_on_surface_2
- to reflect the potential capabilities of the package to construct and maintain arrangements
- induced by curves embedded on two dimensional surfaces in three space. Most of these capabilities
+
- Changed the name of the arrangement package from Arrangement_2 to Arrangement_on_surface_2
+ to reflect the potential capabilities of the package to construct and maintain arrangements
+ induced by curves embedded on two dimensional surfaces in three space. Most of these capabilities
will become available only in future releases though.
-
- Enhanced the geometry traits concept to handle arrangements embedded on surfaces. Each geometry-traits
+
- Enhanced the geometry traits concept to handle arrangements embedded on surfaces. Each geometry-traits
class must now define the 'Boundary_category' tag.
-
- Fixed a bug in Arr_polyline_traits_2.h, where the operator that compares two curves failed to evaluate
+
- Fixed a bug in Arr_polyline_traits_2.h, where the operator that compares two curves failed to evaluate
the correct result (true) when the curves are different, but their graphs are identical.
-
- Permanently removed IO/Arr_postscript_file_stream.h and IO/Polyline_2_postscript_file_stream.h,
+
- Permanently removed IO/Arr_postscript_file_stream.h and IO/Polyline_2_postscript_file_stream.h,
as they depend on obsolete features and LEDA.
-
- Fixed several bugs in the arrangement demo and enhanced it. e.g., fixed background color change,
+
- Fixed several bugs in the arrangement demo and enhanced it. e.g., fixed background color change,
allowed vertex coloring , enabled "smart" color selection, etc.
-
- Enhanced the arrangement demo with new features, such as allowing the abortion of the merge function
+
- Enhanced the arrangement demo with new features, such as allowing the abortion of the merge function
(de-select), updated the how-to description, etc.
-
- Replace the functions CGAL::insert_curve(), CGAL::insert_curves(), CGAL::insert_x_monotone_curve(),
- and CGAL::insert_x_monotone_curves() with a single overloaded function CGAL::insert(). The former
- 4 functions are now deprecated, and may no longer be supported in future releases.
+
- Replace the functions CGAL::insert_curve(), CGAL::insert_curves(), CGAL::insert_x_monotone_curve(),
+ and CGAL::insert_x_monotone_curves() with a single overloaded function CGAL::insert(). The former
+ 4 functions are now deprecated, and may no longer be supported in future releases.
Envelopes of Surfaces in 3D
-- Fixed a bug in the computation of the envelope of unbounded planes caused by multiple removals
+
- Fixed a bug in the computation of the envelope of unbounded planes caused by multiple removals
of vertices at infinity.
2D Regularized Boolean Set-Operations
- Fixed a bug in connect_holes() that caused failures when connecting holes touching the outer boundary.
-
- Fixed the concept GeneralPolygonSetTraits_2. Introduced two new concepts GpsTraitsGeneralPolygon_2
- and GpsTraitsGeneralPolygonWithHoles_2. Fixed the definition of the two nested required types Polygon_2
- and Polygon_with_holes_2 of the GeneralPolygonSetTraits_2 concept. They must model now the two new
- concepts above.
-
- Added a default template parameter to 'General_polygon_set_2' to allow users to pass their specialized
+
- Fixed the concept GeneralPolygonSetTraits_2. Introduced two new concepts GpsTraitsGeneralPolygon_2
+ and GpsTraitsGeneralPolygonWithHoles_2. Fixed the definition of the two nested required types Polygon_2
+ and Polygon_with_holes_2 of the GeneralPolygonSetTraits_2 concept. They must model now the two new
+ concepts above.
+
- Added a default template parameter to 'General_polygon_set_2' to allow users to pass their specialized
DCEL used to instantiate the underlying arrangement.
- Enhanced the BOP demo to use multiple windows.
@@ -1399,10 +1420,10 @@ in functionality. There have also been a number of bug fixes for this release.
2D Minkowski Sums
- Fixed a few bugs in the approximate offset function, making it robust to highly degenerate inputs.
-
- Fixed a bug in the exact Minkowski sum computation when processing degenerate inputs that induce overlapping
+
- Fixed a bug in the exact Minkowski sum computation when processing degenerate inputs that induce overlapping
of contiguous segments in the convolution cycles.
- Optimized the approximate offset function (reduced time consumption up to a factor of 2 in some cases).
-
- Added functionality to compute the offset (or to approximate the offset) of a Polygon_with_holes_2
+
- Added functionality to compute the offset (or to approximate the offset) of a Polygon_with_holes_2
(and not just of a Polygon_2).
- Added the functionality to compute (or to approximate) the inner offset of a polygon.
@@ -1523,7 +1544,7 @@ in functionality. There have also been a number of bug fixes for this release.
Intel C++ compiler 9
Microsoft Visual C++ compiler 8.0
-
+
The following platforms are no longer supported:
@@ -1536,7 +1557,7 @@ of GNU g++'s STL (-D_GLIBCXX_DEBUG).
CGAL now works around the preprocessor macros 'min' and 'max' defined
in <windows.h> which were clashing with min/max functions.
-
+
Installation
@@ -1572,8 +1593,8 @@ This package defines what algebra means for CGAL, in terms of concepts, classes
- 2D Circular Kernel
-Efficiency improved through geometric filtering of predicates, introduced with
- the filtered kernel Filtered_bbox_circular_kernel_2<.>, and also chosen for the
+Efficiency improved through geometric filtering of predicates, introduced with
+ the filtered kernel Filtered_bbox_circular_kernel_2<.>, and also chosen for the
predefined kernel Exact_circular_kernel_2.
- Linear Kernel
@@ -1614,23 +1635,23 @@ Efficiency improved through geometric filtering of predicates, introduced with
- Envelopes of Curves in 2D (new package)
- This package contains two sets of functions that construct the lower and upper envelope diagram
+ This package contains two sets of functions that construct the lower and upper envelope diagram
for a given range of bounded or unbounded curves.
- Envelopes of Surfaces in 3D (new package)
- This package contains two sets of functions that construct the lower and upper envelope diagram
- for a given range of bounded or unbounded surfaces. The envelope diagram is realized as a
+ This package contains two sets of functions that construct the lower and upper envelope diagram
+ for a given range of bounded or unbounded surfaces. The envelope diagram is realized as a
2D arrangement.
- Minkowski Sums in 2D (new package)
- This package contains functions for computing planar Minkowski sums of two closed polygons,
- and for a polygon and a disc (an operation also known as offsetting or dilating a polygon).
- The package also contains an efficient approximation algorithm for the offset computation,
- which provides a guaranteed approximation bound while significantly expediting the running
+ This package contains functions for computing planar Minkowski sums of two closed polygons,
+ and for a polygon and a disc (an operation also known as offsetting or dilating a polygon).
+ The package also contains an efficient approximation algorithm for the offset computation,
+ which provides a guaranteed approximation bound while significantly expediting the running
times w.r.t. the exact computation procedure.
@@ -1648,9 +1669,9 @@ Efficiency improved through geometric filtering of predicates, introduced with
namely lines, rays and line segments.
- Added traits classes that handle circular arcs based on the circular kernel.
- Added a traits class that supports Bezier curves.
-
- Enhanced the traits class that supports rational functions to
+
- Enhanced the traits class that supports rational functions to
handle unbounded (as well as bounded) arcs
-
- Added a free function called decompose() that produces the symbolic vertical decomposition of a
+
- Added a free function called decompose() that produces the symbolic vertical decomposition of a
given arrangement, performing a batched vertical ray-shooting query from all arrangement vertices.
- Fixed a memory leak in the sweep-line code.
- Fixed a bug in computing the minor axis of non-degenerate hyperbolas.
@@ -1658,18 +1679,18 @@ Efficiency improved through geometric filtering of predicates, introduced with
- Boolean Set Operations
-- Added the DCEL as a default template parameter to the General_polygon_set_2 and Polygon_set_2 classes.
+
- Added the DCEL as a default template parameter to the General_polygon_set_2 and Polygon_set_2 classes.
This allows users to extend the DCEL of the underlying arrangement.
-
- Added a function template called connect_holes() that connects the holes in a given polygon with holes,
+
- Added a function template called connect_holes() that connects the holes in a given polygon with holes,
turning it into a sequence of points, where the holes are connceted to the outer boundary using
- zero-width passages.
-
- Added a non-const function member to General_polygon_set_2 that obtains the underlying arrangement.
+ zero-width passages.
+
- Added a non-const function member to General_polygon_set_2 that obtains the underlying arrangement.
- 2D and 3D Triangulations
-- The constructors and insert member functions which take an iterator range perform spatial sorting
+
- The constructors and insert member functions which take an iterator range perform spatial sorting
in order to speed up the insertion.
@@ -1677,7 +1698,7 @@ Efficiency improved through geometric filtering of predicates, introduced with
- Optimal Distances
- |