songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

flattened files and prepared for 4.2

This commit is contained in:
Eric Berberich 2012-12-21 15:36:39 +01:00
parent fd0a400fba
commit bf4bdda1e3
30 changed files with 8 additions and 2077 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
Maintenance/public_release/announcement/CGAL-2.2
View File

@ -1,33 +0,0 @@
Subject: CGAL 2.2, Computational Geometry Algorithms Library
Body:
We are pleased to announce release 2.2 of CGAL, the Computational
Geometry Algorithms Library.
Major additions in this release are:
o Support for the Borlnd compiler (5.5) on windows and the KAI compiler
on Solaris.
o Several optimisation algorithms (smallest enclosing annulus,
polytope_distance, width of point sets in 3D)
o Additions to 2d and 3d triangulations and 2d arrangements.
o Demos showing robustnees problems and their solutions.
o and more
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms. The CGAL library contains:
o Basic geometric primitives such as points, vectors, lines, predicates
for testing things such as relative positions of points, and operations
such as intersections and distance calculation.
o A collection of standard data structures and geometric algorithms,
such as convex hull, (Delaunay) triangulation, planar map, polyhedron,
smallest enclosing sphere, and multidimensional query structures.
o Interfaces to other packages, e.g. for visualisation, and I/O, and
other support facilities.
For further information and for downloading the library and its
documentation, please visit the CGAL web page:
http://www.cgal.org/
Should you have any questions or comments, please send a message to
contact@cgal.org

45
Maintenance/public_release/announcement/CGAL-2.3
View File

@ -1,45 +0,0 @@
Subject: CGAL 2.3, Computational Geometry Algorithms Library
Body:
We are pleased to announce release 2.3 of CGAL, the Computational
Geometry Algorithms Library.
Major additions in this release include:
o Realization of a new kernel concept that provides more flexibility
while being completely compatable with the previous design
o d-dimensional kernel, convex hull and Delaunay triangulations
o Redesign of the halfedge data structure to provide better
extensibility
o Improvements and additions in 2d and 3d triangulations and 2d
planar maps and arrangements.
o Boolean operations on polygons are provided via 2D Nef polyhedra
o Dependencies on the LEDA library have been removed, except in the
case of the PostScript stream.
See http://www.cgal.org/releases_frame.html for a complete list of
changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms. The CGAL library contains:
o Basic geometric primitives such as points, vectors, lines, predicates
for testing things such as relative positions of points, and operations
such as intersections and distance calculation.
o A collection of standard data structures and geometric algorithms,
such as convex hull, (Delaunay) triangulation, planar map, polyhedron,
smallest enclosing sphere, and multidimensional query structures.
o Interfaces to other packages, e.g. for visualisation, and I/O, and
other support facilities.
For further information and for downloading the library and its
documentation, please visit the CGAL web page:
http://www.cgal.org/
For information about services supporting and complementing CGAL,
please visit:
http://www.geometryfactory.com
Should you have any questions or comments, please send a message to
contact@cgal.org

40
Maintenance/public_release/announcement/CGAL-2.4
View File

@ -1,40 +0,0 @@
Subject: CGAL 2.4, Computational Geometry Algorithms Library
Body:
We are pleased to announce release 2.4 of CGAL, the Computational
Geometry Algorithms Library.
Major additions in this release include:
o Support for Visual C++ 7.0, SunPro 5.3, and g++ 3.1
o A sweep-line algorithm to compute arrangements of curves
o Quicker insertion functions for planar maps
o 2D constrained triangulations with intersecting constraints
o running time improvements for 3D triangulations
o Polyhedral surface design introduced with release 2.3 is now supported on
Visual C++ 7.0
o A widget for visualization of 2D CGAL objects based on Trolltech's Qtwidget.
o Microsoft Visual Studio project files for the library, examples, and demos.
See http://www.cgal.org/releases_frame.html for a complete list of
changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms. The CGAL library contains:
o Basic geometric primitives such as points, vectors, lines, predicates
for testing things such as relative positions of points, and operations
such as intersections and distance calculation.
o A collection of standard data structures and geometric algorithms,
such as convex hull, (Delaunay) triangulation, planar map, polyhedron,
smallest enclosing sphere, and multidimensional query structures.
o Interfaces to other packages, e.g. for visualization, and I/O, and
other support facilities.
For further information and for downloading the library and its
documentation, please visit the CGAL web page:
http://www.cgal.org/
Should you have any questions or comments, please send a message to
contact@cgal.org

61
Maintenance/public_release/announcement/CGAL-3.0
View File

@ -1,61 +0,0 @@
Subject: CGAL 3.0 Released, Computational Geometry Algorithms Library
Body:
We are pleased to announce the release 3.0 of CGAL, the Computational Geometry
Algorithms Library. Version 3.0 differs from version 2.4 in licensing, in the
platforms that are supported and in functionality.
The license has been changed to either the LGPL (GNU Lesser General Public
License v2.1) or the QPL (Q Public License v1.0) depending on each package.
So CGAL remains free of use for you, if your usage meets the criteria of
these licenses, otherwise, a commercial license has to be purchased from
Geometry Factory (www.geometryfactory.com).
Major changes in this release include the following:
o Apollonius graph: the dual of the Voronoi diagram of a set of circles under
the Euclidean metric. The implementation is dynamic.
o Min_sphere_of_spheres_d: Algorithms to compute the smallest enclosing sphere
of a given set of spheres in d-dimensional space.
o Spatial Searching: Provides exact and approximate distance browsing in a set
of points in d-dimensional space (such as nearest neighbor searching).
o Largest_empty_iso_rectangle_2: Given a set of points P in the plane,
computes the largest empty iso-rectangle that are inside a given
iso-rectangle bounding box, and that do not contain any point of P.
o Interval_skip_list: A data strucure for finding all intervals in R that
contain a value, and for stabbing queries, that is for answering the
question whether a given value is contained in an interval or not.
o Existing packages have been improved in various area:
2D and 3D triangulations, Planar Maps, Arrangements...
o The CORE library (http://www.cs.nyu.edu/exact/core/) for exact computations
is now distributed as part of CGAL as well.
o We support the latest versions of the C++ compilers from GNU, Microsoft,
Intel, Sun, SGI.
o All demos are now using the portable Qt window toolkit.
See http://www.cgal.org/releases_frame.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms. The CGAL library contains:
o Basic geometric primitives such as points, vectors, lines, predicates
for testing things such as relative positions of points, and operations
such as intersections and distance calculation.
o A collection of standard data structures and geometric algorithms,
such as convex hull, (Delaunay, Regular, Constrained) triangulation, Voronoi
diagrams, planar map, arrangements, polyhedron, smallest enclosing sphere,
multidimensional query structures...
o Interfaces to other packages, e.g. for visualization, and I/O, and
other support facilities.
For further information and for downloading the library and its
documentation, please visit the CGAL web page: http://www.cgal.org/

40
Maintenance/public_release/announcement/CGAL-3.0.1
View File

@ -1,40 +0,0 @@
Subject: CGAL 3.0.1 Released
Body:
We are pleased to announce the release 3.0.1 of CGAL, the Computational
Geometry Algorithms Library. Version 3.0.1 is a bug-fix release for
version 3.0. No new features have been added in 3.0.1. Here is the list
of bug-fixes.
Polyhedron:
- Fixed wrong include files for output support. Added example.
Planar_map :
- Fixed the so called "Walk-along-a-line" point-location strategy to
correctly handle a degenerate case.
Triangulation_2 :
- added missing figure in html doc
- in Line_face_circulator_2.h :
Fixed changes made to support handles with a typedef to iterator.
The fix concerns operator== and !=.
Alpha_shapes_3 :
- fixed classify member function for edges
Number types :
- Lazy_exact_nt :
- added the possibility to select the relative precision of to_double()
(by default 1e-5). This should fix reports that some circumcenters
computations have poor coordinates, e.g. nan).
- when exact computation is triggered, the interval is recomputed, this
should speed up some kinds of computations.
- to_interval(Quotient<MP_Float>) : avoid spurious overflows.
Kernel :
- missing acknowledgment in the manual and minor clarification of
intersect() documentation.
For further information and for downloading the library and its
documentation, please visit the CGAL web page: http://www.cgal.org/

90
Maintenance/public_release/announcement/CGAL-3.1
View File

@ -1,90 +0,0 @@
Subject: CGAL 3.1 Released, Computational Geometry Algorithms Library
Body:
We are pleased to announce the release 3.1 of CGAL, the Computational Geometry
Algorithms Library.
Besides improvements of existing packages this release offers
the following new algorithms and data structures.
o 2D Segment Voronoi Diagram
An incremental algorithm for Voronoi diagrams of segments in the plane
under the Euclidean metric. The Voronoi edges are arcs of straight lines
and parabolas. In case the input segments intersect, the Voronoi diagram
of their arrangement is computed.
o 2D Conforming Triangulations and Meshes
An implementation of Shewchuk's algorithm to construct conforming
triangulations and 2D meshes.
o 3D Boolean Operations on Nef Polyhedra
A data structure representing 3D Nef polyhedra, a boundary representation
for cell-complexes bounded by halfspaces that supports Boolean operations
and topological operations in full generality including unbounded cells,
mixed dimensional cells (e.g., isolated vertices and antennas). Nef
polyhedra distinguish between open and closed sets and can represent
non-manifold geometry.
Also available are planar Nef polyhedra embedded on the sphere.
o dD Box Intersection Testing and Reporting
A new efficient algorithm for finding all intersecting pairs for large
numbers of iso-oriented boxes. Typically these will be bounding
boxes of more complicated geometries. Useful for (self-) intersection
tests of surfaces etc.
o 2D Snap Rounding
An algorithm for converting arbitrary-precision arrangements of segments
into a fixed-precision representation. An Iterated Snap Rounding algorithm
is also available in which each vertex is at least half the width of a
pixel away from any non-incident edge.
o 2D and Surface Function Interpolation
Several algorithms for scattered data interpolation from measures of a
function on a set of discrete data points. The package further offers
functions for natural neighbor interpolation.
See http://www.cgal.org/releases_frame.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms. The CGAL library contains:
o The Kernel providing basic geometric primitives such as points, vectors,
lines, predicates for testing things such as relative positions of points,
and operations such as intersections and distance calculation.
o The Basic Library, a collection of standard data structures and geometric
algorithms, such as convex hull, (Delaunay, Regular, Constrained)
triangulation, Voronoi diagrams, planar map, arrangements, polyhedron,
smallest enclosing sphere, multidimensional query structures...
o Interfaces to other packages, e.g. for visualization, and I/O, and
other support facilities.
The Kernel is distributed under the terms of the LGPL Open Source license
(GNU Lesser General Public License v2.1).
The Basic Library is distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license must be purchased from
GeometryFactory (www.geometryfactory.com).
For further information and for downloading the library and its
documentation, please visit the CGAL web page: http://www.cgal.org/

172
Maintenance/public_release/announcement/CGAL-3.2
View File

@ -1,172 +0,0 @@
Subject: CGAL 3.2 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the release 3.2 of
CGAL, the Computational Geometry Algorithms Library.
Besides improvements of existing packages this release offers
the following new algorithms and data structures.
o 2D Regularized Boolean Set-Operations
This package consists of the implementation of Boolean
set-operations on point sets bounded by weakly x-monotone curves in
2-dimensional Euclidean space. In particular, it contains the
implementation of regularized Boolean set-operations, intersection
predicates, and point containment predicates.
o 2D Straight Skeleton and Polygon Offsetting
This package implements an algorithm to construct a halfedge data
structure representing the straight skeleton in the interior of 2D
polygons with holes and an algorithm to construct inward offset
polygons at any offset distance given a straight skeleton.
o 2D Voronoi Diagram
The 2D Voronoi diagram package provides an adaptor that adapts a
2-dimensional triangulated Delaunay graph to the corresponding
Voronoi diagram, represented as a doubly connected edge list (DCEL)
data structure. The adaptor has the ability to automatically
eliminate, in a consistent manner, degenerate features of the
Voronoi diagram, that are artifacts of the requirement that
Delaunay graphs should be triangulated even in degenerate
configurations. Depending on the type of operations that the
underlying Delaunay graph supports, the adaptor allows for the
incremental or dynamic construction of Voronoi diagrams and can
support point location queries.
o 3D Surface Mesher
This package provides functions to generate surface meshes that
interpolate smooth surfaces. The meshing algorithm is based on
Delaunay refinement and provides some guarantees on the resulting
mesh: the user is able to control the size and shape of the mesh
elements and the accuracy of the surface approximation. There is no
restriction on the topology and number of components of input
surfaces. The surface mesher may also be used for non smooth
surfaces but without guarantee.
Currently, implementations are provided for implicit surfaces
described as the zero level set of some function and surfaces
described as a gray level set in a three-dimensional image.
o 3D Surface Subdivision Methods
Subdivision methods recursively refine a control mesh and generate
points approximating the limit surface. This package consists of
four popular subdivision methods and their refinement hosts.
Supported subdivision methods include Catmull-Clark, Loop, Doo-Sabin
and sqrt(3) subdivisions. Their respective refinement hosts are
PQQ, PTQ, DQQ and sqrt(3) refinements. Variations of those methods
can be easily extended by substituting the geometry computation of
the refinement host.
o Planar Parameterization of Triangulated Surface Meshes
Parameterizing a surface amounts to finding a one-to-one mapping
from a suitable domain to the surface. In this package, we focus
on triangulated surfaces that are homeomorphic to a disk and on
piecewise linear mappings into a planar domain. This package
implements some of the state-of-the-art surface mesh
parameterization methods, such as least squares conformal maps,
discrete conformal map, discrete authalic parameterization,
Floater mean value coordinates or Tutte barycentric mapping.
o Principal Component Analysis
This package provides functions to compute global informations on
the shape of a set of 2D or 3D objects such as points. It provides
the computation of axis-aligned bounding boxes, centroids of point
sets, barycenters of weighted point sets, as well as linear least
squares fitting for point sets in 2D, and point sets as well as
triangle sets in 3D.
o 2D Placement of Streamlines
Visualizing vector fields is important for many application domains.
A good way to do it is to generate streamlines that describe the
flow behavior. This package implements the "Farthest Point Seeding"
algorithm for placing streamlines in 2D vector fields. It generates
a list of streamlines corresponding to an input flow using a
specified separating distance. The algorithm uses a Delaunay
triangulation to model objects and adress different queries, and
relies on choosing the centers of the biggest empty circles to start
the integration of the streamlines.
o Kinetic Data Structures
Kinetic data structures allow combinatorial structures to be
maintained as the primitives move. The package provides
implementations of kinetic data structures for Delaunay
triangulations in two and three dimensions, sorting of points in
one dimension and regular triangulations in three dimensions.
The package supports exact or inexact operations on primitives
which move along polynomial trajectories.
o Kinetic Framework
Kinetic data structures allow combinatorial geometric structures
to be maintained as the primitives move. The package provides a
framework to ease implementing and debugging kinetic data
structures. The package supports exact or inexact operations on
primitives which move along polynomial trajectories.
o Smallest Enclosing Ellipsoid
An approximative algorithm for constructing the smallest enclosing
ellipsoid in d-dimensional Euclidean space.
See http://www.cgal.org/releases_frame.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations and Delaunay
triangulations in 2D and 3D),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- arrangements of curves,
- mesh algorithms (2D Delaunay mesh generation and 3D surface mesh
generation, surface mesh subdivision and parameterization),
- alpha shapes,
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimisation algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures.
Some modules are distributed under the terms of the LGPL Open Source
license(GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license must be purchased from
GeometryFactory (www.geometryfactory.com).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

118
Maintenance/public_release/announcement/CGAL-3.3
View File

@ -1,118 +0,0 @@
Subject: CGAL 3.3 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the release 3.3 of
CGAL, the Computational Geometry Algorithms Library.
Besides improvements to existing packages, this release offers
the following new algorithms and data structures.
o Surface Mesh Simplification
This package provides a mesh simplification framework using edge collapse
operations, and provides the Turk/Lindstrom simplification algorithm.
o Estimation of Local Differential Properties
This package allows to compute local differential quantities of a surface
from a point sample.
o Approximation of Ridges and Umbilics on Triangulated Surface Meshes
This package enables the approximation of differential features on
triangulated surface meshes. Such curvature related features are
lines: ridges or crests, and points: umbilics.
o Envelopes of Curves in 2D
This package contains two sets of functions that construct the lower and
upper envelope diagram for a given set of bounded or unbounded curves.
o Envelopes of Surfaces in 3D
This package contains two sets of functions that construct the lower and
upper envelope diagram for a given set of bounded or unbounded surfaces.
The envelope diagram is realized as a 2D arrangement.
o Minkowski Sums in 2D
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.
o CGAL and the Boost Graph Library
This package provides the glue layer for several CGAL data structures such
that they become models of the BGL graph concept and thus can interoperate
with the graph algorithms of Boost.
o Spatial Sorting
This package allows to sort points and other objects along a Hilbert curve
which can improve the performance of algorithms like triangulations.
It is used by the constructors of the triangulation classes which have
an iterator range of points as argument.
o Linear and Quadratic Programming Solver
This package contains algorithms for minimizing linear and convex quadratic
functions over polyhedral domains, described by linear equations and
inequalities.
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations and Delaunay
triangulations in 2D and 3D),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- Regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh algorithms (2D Delaunay mesh generation and 3D surface mesh
generation, surface mesh subdivision and parameterization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimisation algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

91
Maintenance/public_release/announcement/CGAL-3.3-RC
View File

@ -1,91 +0,0 @@
Subject: CGAL 3.3 Release Candidate
Body:
The CGAL Open Source Project is pleased to announce the release candidate
for Release 3.3 of CGAL, the Computational Geometry Algorithms Library.
You can download the tarball from
ftp://ftp.mpi-sb.mpg.de/pub/outgoing/CGAL/CGAL-3.3-RC1.tar.gz
For Windows we also provide an installer, with precompiled libraries
ftp://ftp.mpi-sb.mpg.de/pub/outgoing/CGAL/CGAL-3.3-Setup.exe
The online version of the manual can be found at
http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/contents.html
We are looking forward to get your feedback and plan to release CGAL-3.3
one week from today.
Besides improvements of existing packages this release offers
the following new algorithms and data structures.
o Surface Mesh Simplification
This package provides a mesh simplification framework using edge collapse
operations, and provides the Turk/Lindstrom simplification algorithm.
o Estimation of Local Differential Properties
This package allows to compute local differential quantities of a surface
from a point sample.
o Approximation of Ridges and Umbilics on Triangulated Surface Meshes
This package enables the approximation of differential features on
triangulated surface meshes. Such curvature related features are
lines: ridges or crests, and points: umbilics.
o Envelopes of Curves in 2D
This package contains two sets of functions that construct the lower and
upper envelope diagram for a given range of bounded or unbounded curves.
o Envelopes of Surfaces in 3D
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.
o Minkowski Sums in 2D
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.
o CGAL and the Boost Graph Library
This package provides the glue layer for several CGAL data structures such
that they become models of the BGL graph concept.
o Spatial Sorting
This package allows to sort points and other objects along a Hilbert curve
which can improve the performance of algorithms like triangulations.
It is used by the constructors of the triangulation package which have
an iterator range of points as argument.
o Linear and Quadratic Programming Solver
This package contains algorithms for minimizing linear and convex quadratic
functions over polyhedral domains, described by linear equations and inequalities.
See also the Package Overview at
http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/packages.html

84
Maintenance/public_release/announcement/CGAL-3.3.1
View File

@ -1,84 +0,0 @@
Subject: CGAL 3.3.1 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the release 3.3.1 of
CGAL, the Computational Geometry Algorithms Library.
Version 3.3.1 is a bug-fix release for version 3.3. No new features have
been added in 3.3.1. The following corrections have been made:
General
- Intel C++ 9 was wrongly recognized as unsupported by install_cgal.
- Added autolink (for Visual C++) for the CGALImageIO and CGALPDB libraries.
- Fixed bug in Memory_sizer when using more than 4GB of memory (64bit).
Number Types
- Fixed bug in FPU rounding mode macros (affected only the alpha architecture).
- Fixed bug in MP_Float constructor from double for some particular values.
Kernel
- Fixed forgotten derivation in Circular_kernel_2::Has_on_2
Skin Surface Meshing
- The new Skin Surface Meshing package had been forgotten in the list of
changes and the release announcement of CGAL 3.3:
This package allows to build a triangular mesh of a skin surface.
Skin surfaces are used for modeling large molecules in biological
computing.
Arrangements
- Fixed a bug in the Arrangement_2 package in dual arrangement representation
for Boost graphs when reporting all halfedges of a face.
- Fixed a bug in the Arrangement sweep-line when using a specific polyline
configuration.
- Fixed bug in Arrangement_2 in walk along a line point location for
unbounded curves.
- Fixed bug in aggregated insertion to Arrangement_2.
- Fixed bug in Arrangment_2 class when inserting an unbounded curve from
an existing vertex.
- Fixed bug when dealing with a degenerate conic arc in Arr_conic_traits_2
of the Arrangment package, meaning a line segment which is part of a
degenerate parabola/hyperbola.
- Fixed bug in the Bezier traits-class:
properly handle line segments.
properly handle comparison near a vertical tangency.
2D Polygon
- Fixed bug in degenerate case of Polygon_2::is_convex() for equal points.
2D Triangulations
- Fixed bug in Regular_triangulation_2.
Interpolation
- Fixed bug in Interpolation 3D about the normalization coefficient
initialization.
3D Boolean Operations on Nef Polyhedra
- Fixed bug in construction of Nef_polyhedron_3 from off-file.
Now, always the inner volume is selected.
- Fixed bug in conversion from Nef_polyhedron_3 to Polyhedron_3.
Polyhedron_3 was not cleared at the beginning.
- Fixed bug in Nef_polyhedron_3 in update of indexes for construction of
external structure.
Third Party Libraries Shipped with CGAL
- TAUCS supports now 64 bits platforms.
- CAUTION: Since version 3.3.1, CGAL is no longer compatible with the official
release of TAUCS (currently 2.2). Make sure to use the version
modified by the CGAL project and available from the download
section of http://www.cgal.org.
See http://www.cgal.org/releases.html for a complete list of changes.

87
Maintenance/public_release/announcement/CGAL-3.4
View File

@ -1,87 +0,0 @@
Subject: CGAL Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the Release 3.4
of CGAL, the Computational Geometry Algorithms Library.
An important change from CGAL 3.3 to CGAL 3.4 is the switch
from a proprietary installation script to CMake.
Besides improvements to existing packages, this release offers the
following new algorithms and data structures.
o Algebraic Foundations
This package defines what algebra means for CGAL, in terms of
concepts, classes and functions.
o Polynomial
This package introduces a concept Polynomial_d, a concept for
multivariate polynomials in d variables.
o Modular Arithmetic
This package provides arithmetic over finite fields.
o 3D Spherical Geometry Kernel
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.
o CGAL and the Qt4 GraphicsView
2D CGAL Kernel objects and many data structures have can be rendered
in a QGraphicsView.
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations and Delaunay
triangulations in 2D and 3D),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- Regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh algorithms (2D Delaunay mesh generation and 3D surface mesh
generation, surface mesh subdivision and parameterization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimization algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

97
Maintenance/public_release/announcement/CGAL-3.4Beta
View File

@ -1,97 +0,0 @@
Subject: CGAL 3.4 Beta 1 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the Release 3.4 Beta 1
of CGAL, the Computational Geometry Algorithms Library.
CGAL-3.4 Beta 1 is the first public testing release. It should provide
a solid ground to report bugs that need to be tackled before the
release of the final version of CGAL 3.4 in January 2009.
An important change from CGAL 3.3 to CGAL 3.4 is the switch
from a proprietary installation script to CMake.
Besides improvements to existing packages, this release offers the
following new algorithms and data structures.
o Algebraic Foundations
This package defines what algebra means for CGAL, in terms of concepts, classes and functions.
o Polynomial
This package introduces a concept Polynomial_d, a concept for multivariate polynomials in d variables.
o Modular Arithmetic
This package provides arithmetic over finite fields.
o 3D Spherical Geometry Kernel
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.
o 3D Minkowski Sum
This package provides a function, which computes the Minkowski sum of two point sets in R^3.
o Convex Decomposition of Polyhedra
This package allows to decompose a 3D Nef Polyhedron in convex parts.
o CGAL and the Qt4 GraphicsView
2D CGAL Kernel objects and many data structures have can be rendered in a QGraphicsView.
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations and Delaunay
triangulations in 2D and 3D),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- Regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh algorithms (2D Delaunay mesh generation and 3D surface mesh
generation, surface mesh subdivision and parameterization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimization algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

92
Maintenance/public_release/announcement/CGAL-3.5
View File

@ -1,92 +0,0 @@
Subject: CGAL 3.5 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the Release 3.5
of CGAL, the Computational Geometry Algorithms Library.
Besides improvements to existing packages, this release offers the
following new algorithms and data structures.
o 3D Periodic Triangulations (new package)
This package allows to build and handle triangulations of point sets in
the three dimensional flat torus. Triangulations are built
incrementally and can be modified by insertion or removal of
vertices. They offer point location facilities.
o Surface Reconstruction from Point Sets (new package)
This CGAL package implements an implicit surface reconstruction method:
Poisson Surface Reconstruction. The input is an unorganized point set
with oriented normals.
o 3D Mesh Generation (new package)
This package generates 3 dimensional meshes. It computes isotropic
simplicial meshes for domains or multidomains provided that a domain
descriptor, able to answer queries from a few different types on the
domain, is given. In the current version, Mesh_3 generate meshes for
domain described through implicit functional, 3D images or polyhedral
boundaries. The output is a 3D mesh of the domain volume and conformal
surface meshes for all the boundary and subdividing surfaces.
o Point Set Processing (new package)
This packages implements a set of algorithms for analysis, processing,
and normal estimation and orientation of point sets.
o AABB tree (new package)
This package implements a hierarchy of axis-aligned bounding boxes (a
AABB tree) for efficient intersection and distance computations between
3D queries and sets of input 3D geometric objects.
o CGAL_ipelets (new package)
Object that eases the writing of Ipe's plugins that use CGAL.
Plugins for CGAL main 2D algorithm are provided as demo.
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations and Delaunay
triangulations in 2D and 3D),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- Regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh algorithms (2D Delaunay mesh generation and 3D surface mesh
generation, surface mesh subdivision and parameterization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimization algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

96
Maintenance/public_release/announcement/CGAL-3.5-beta1
View File

@ -1,96 +0,0 @@
Subject: CGAL 3.5 Beta 1 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the Release 3.5 Beta 1
of CGAL, the Computational Geometry Algorithms Library.
CGAL-3.5-beta1 is a public testing release. It should provide
a solid ground to report bugs that need to be tackled before the
release of the final version of CGAL 3.5 in mid September 2009.
Besides improvements to existing packages, this release offers the
following new algorithms and data structures.
o 3D Periodic Triangulations (new package)
This package allows to build and handle triangulations of point sets in
the three dimensional flat torus. Triangulations are built
incrementally and can be modified by insertion or removal of
vertices. They offer point location facilities.
o Surface Reconstruction from Point Sets (new package)
This CGAL package implements an implicit surface reconstruction method:
Poisson Surface Reconstruction. The input is an unorganized point set
with oriented normals.
o 3D Mesh Generation (new package)
This package generates 3 dimensional meshes. It computes isotropic
simplicial meshes for domains or multidomains provided that a domain
descriptor, able to answer queries from a few different types on the
domain, is given. In the current version, Mesh_3 generate meshes for
domain described through implicit functional, 3D images or polyhedral
boundaries. The output is a 3D mesh of the domain volume and conformal
surface meshes for all the boundary and subdividing surfaces.
o Point Set Processing (new package)
This packages implements a set of algorithms for analysis, processing,
and normal estimation and orientation of point sets.
o AABB tree (new package)
This package implements a hierarchy of axis-aligned bounding boxes (a
AABB tree) for efficient intersection and distance computations between
3D queries and sets of input 3D geometric objects.
o CGAL_ipelets (new package)
Object that eases the writing of Ipe's plugins that use CGAL.
Plugins for CGAL main 2D algorithm are provided as demo.
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations and Delaunay
triangulations in 2D and 3D),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- Regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh algorithms (2D Delaunay mesh generation and 3D surface mesh
generation, surface mesh subdivision and parameterization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimization algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

29
Maintenance/public_release/announcement/CGAL-3.5.1
View File

@ -1,29 +0,0 @@
Subject: CGAL 3.5.1 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the release 3.5.1 of
CGAL, the Computational Geometry Algorithms Library.
Version 3.5.1 is a bug-fix release for version 3.5. No new feature has
been added in 3.5.1. The following corrections have been made:
Documentation:
- Fixes in the documentation (the online documentation of CGAL-3.5 is now
based on CGAL-3.5.1).
- Fixes to the bibliographic references.
Windows installer:
- The Windows installer of CGAL-3.5.1 fixes an issue with downloading of
precompiled binaries of the external library TAUCS.
Bug fixes in the following CGAL packages:
- AABB tree:
- Fix a linker issue in do_intersect(Bbox_3,Bbox_3).
- Fix compilation issue in do_intersect(Bbox_3,Ray_3) when using the
parameters in this order.
- 3D Mesh Generation:
- Fix a bug in initial points construction of a polyhedral surface.
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

69
Maintenance/public_release/announcement/CGAL-3.6
View File

@ -1,69 +0,0 @@
Subject: CGAL 3.6 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the Release 3.6
of CGAL, the Computational Geometry Algorithms Library.
Besides improvements and fixes to existing packages, this release offers
the following new features.
o 3D Periodic Triangulations
The package can now be used with the 3D Alpha Shapes package to compute
periodic alpha shapes.
o 3D Mesh Generation
The mesh generator has been enriched with an optimization phase to
provide 3D meshes with well shaped tetrahedra (and in particular no
slivers).
o Algebraic Kernel (new package)
This new package provides implementations of algorithms to determine,
compare and approximate real roots of univariate polynomials and
bivariate polynomial systems.
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations and Delaunay
triangulations in 2D and 3D),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- Regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh algorithms (2D Delaunay mesh generation and 3D surface mesh
generation, surface mesh subdivision and parameterization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimization algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

68
Maintenance/public_release/announcement/CGAL-3.6-beta1
View File

@ -1,68 +0,0 @@
Subject: CGAL 3.6 Beta 1 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the Release 3.6 Beta 1
of CGAL, the Computational Geometry Algorithms Library.
CGAL-3.6-beta1 is a public testing release. It should provide
a solid ground to report bugs that need to be tackled before the
release of the final version of CGAL 3.6 in third week of March 2010.
Besides improvements and fixes to existing packages, this release offers
the following new features.
o 3D Mesh Generation
The mesh generator has been enriched with an optimization phase to
provide 3D meshes with well shaped tetrahedra (and in particular no
slivers).
o Algebraic Kernel (new package)
This new package provides implementations of algorithms to determine,
compare and approximate real roots of univariate polynomials and
bivariate polynomial systems.
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations and Delaunay
triangulations in 2D and 3D),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- Regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh algorithms (2D Delaunay mesh generation and 3D surface mesh
generation, surface mesh subdivision and parameterization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimization algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

92
Maintenance/public_release/announcement/CGAL-3.6.1
View File

@ -1,92 +0,0 @@
Subject: CGAL 3.6.1 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the release 3.6.1 of
CGAL, the Computational Geometry Algorithms Library.
Version 3.6.1 is a bug-fix release for version 3.6. No new feature has
been added in 3.6.1. The following corrections have been made:
1. General
- Fix compilation errors with recent Boost versions (since 1.40).
- Initial support for the Microsoft Visual C++ compiler 10.0 (MSVC
2010).
For that support, CMake>=2.8.2 is required. Note also that the
compiler option "/bigobj" is necessary to compile some CGAL programs
with MSVC 2010. The Windows installer CGAL-3.6.1-Setup.exe does not
support VC++10. The source tarball must be downloaded instead and unpacked
manually. Precompiled binaries of GMP and MPFR must be downloaded from
GForge:
https://gforge.inria.fr/frs/?group_id=52
Download either gmp-5.0.1_and_mpfr-3.0.0_precompiled_i686.zip (for
32 bits compilers) or gmp-5.0.1_and_mpfr-3.0.0_precompiled_x64.zip (for
64 bits compilers) and unpack that zip file directly into the
sub-directory auxiliary/gmp/ of the unpacked sources directory
CGAL-3.6.1/. So that the files are put in
CGAL-3.6.1/auxilary/gmp/include/ and CGAL-3.6.1/auxilary/gmp/lib/. Then
continue with the CMake configuration and the compilation, as
instructed in the installation manual.
2. Polynomial
- Fix compilation errors with the Microsoft Visual C++ compiler and the
Intel C++ compiler.
3. Polyhedron
- Fix a compilation errors in demo/Polyhedron/:
- issue with the location of qglobal.h of Qt4 on MacOS X,
- missing texture.cpp, if TAUCS is used,
- 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:
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.
4. 3D Periodic Triangulations
- Fixed bug in the triangulation hierarchy for periodic triangulations.
5. 2D Mesh Generation
- Fix a bug that lead to precondition violation.
- Improve the user manual about the member function is_in_domain() of the
Face type.
- The 2D meshing process is now deterministic (sorting of bad faces no
longer relies on pointers comparisons).
6. 3D Mesh Generation
- Fix a linking errors (duplicate symbols) when <CGAL/refine_mesh_3.h> is
included in different compilation units.
7. Spatial Searching
- Fix a bug in <CGAL/Orthogonal_k_neighbor_search.h> when several
nearest neighbors are at the same distance from the query point.
8. IO Streams
- Fix a bug in <CGAL/IO/VRML_2_ostream.h> that generated VRML 2 files with
an invalid syntax for IndexedFaceSet nodes.
9. Triangulation_2
- Add missing Compare_distance_2 functor in trait classes
Triangulation_euclidean_traits_xy_3 Triangulation_euclidean_traits_yz_3
and Triangulation_euclidean_traits_xz_3. This was preventing calling
member function nearest_vertex of Delaunay_triangulation_2 instantiated
with one of these traits.
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

51
Maintenance/public_release/announcement/CGAL-3.7
View File

@ -1,51 +0,0 @@
Subject: CGAL 3.7 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the Release 3.7
of CGAL, the Computational Geometry Algorithms Library.
CGAL-3.7 provides improvements and fixes to existing packages, and support
for new compilers.
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations, Delaunay triangulations in
2D and 3D, periodic Delaunay triangulations in 3D),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- Regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh generation (2D, 3D and surface mesh generations)
and processing (surface mesh subdivision and parametrization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimization algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

55
Maintenance/public_release/announcement/CGAL-3.7-beta1
View File

@ -1,55 +0,0 @@
Subject: CGAL 3.7 Beta 1 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the Release 3.7 Beta 1
of CGAL, the Computational Geometry Algorithms Library.
CGAL-3.7-beta1 is a public testing release. It should provide
a solid ground to report bugs that need to be tackled before the
release of the final version of CGAL 3.7 end of September 2010.
CGAL-3.7 provides improvements and fixes to existing packages, and support
for new compilers.
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations, Delaunay triangulations in
2D and 3D, periodic Delaunay triangulations in 3D),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- Regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh algorithms (2D Delaunay mesh generation and 3D surface mesh
generation, surface mesh subdivision and parameterization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimization algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

69
Maintenance/public_release/announcement/CGAL-3.8
View File

@ -1,69 +0,0 @@
Subject: CGAL 3.8 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the Release 3.8
of CGAL, the Computational Geometry Algorithms Library.
Besides fixes to existing packages major features where added
in the following packages.
o 3D Mesh Generation
This package now can handle sharp features: the 3D Mesh
generation package now offers the possibility to get in the
final mesh an accurate representation of 1-dimensional
sharp features present in the description of the input domain.
o 2D and 3D Triangulations
Add a way to efficiently insert a range of points with information
into a Delaunay and Regular triangulation.
o 3D Alpha Shapes
The new class Fixed_alpha_shape_3 provides a robust and
faster way to compute one alpha shape (with a fixed value of alpha).
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations and Delaunay
triangulations in 2D and 3D),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- Regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh algorithms (2D Delaunay mesh generation and 3D surface mesh
generation, surface mesh subdivision and parameterization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimization algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

74
Maintenance/public_release/announcement/CGAL-3.8-beta
View File

@ -1,74 +0,0 @@
Subject: CGAL 3.8 Beta 1 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the Release 3.8 Beta 1
of CGAL, the Computational Geometry Algorithms Library.
CGAL-3.8-beta is a public testing release. It should provide
a solid ground to report bugs that need to be tackled before the
release of the final version of CGAL 3.8 end of September 2010.
Besides fixes to existing packages major features where added
in the following packages.
o 3D Mesh Generation
This package now can handle sharp features: the 3D Mesh
generation package now offers the possibility to get in the
final mesh an accurate representation of 1-dimensional
sharp features present in the description of the input domain.
o 2D and 3D Triangulations
Add a way to efficiently insert a range of points with information
into a Delaunay and Regular triangulation.
o 3D Alpha Shapes
The new class Fixed_alpha_shape_3 provides a robust and
faster way to compute one alpha shape (with a fixed value of alpha).
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations and Delaunay
triangulations in 2D and 3D),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- Regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh algorithms (2D Delaunay mesh generation and 3D surface mesh
generation, surface mesh subdivision and parameterization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimization algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

67
Maintenance/public_release/announcement/CGAL-3.9
View File

@ -1,67 +0,0 @@
Subject: CGAL 3.9 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the Release 3.9
of CGAL, the Computational Geometry Algorithms Library.
Besides fixes to existing packages major features where added
in the following packages.
o Combinatorial Maps (new package)
This package provides a new combinatorial data structure allowing to
describe any orientable subdivided object whatever its dimension.
o 3D Convex Hull
The quickhull implementation of CGAL (CGAL::convex_hull_3) has been worked
out to provide much better performances
o 2D Arrangements
A new geometry-traits class that handles rational arcs has been
introduced. It replaced an old traits class, which handled the same
family of curves, but it was less efficient.
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations and Delaunay
triangulations in 2D and 3D, periodic triangulations),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh generation (2D, 3D and surface mesh generation,
surface mesh subdivision and parametrization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimization algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

72
Maintenance/public_release/announcement/CGAL-3.9-beta1
View File

@ -1,72 +0,0 @@
Subject: CGAL 3.9 Beta 1 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the Release 3.9 Beta 1
of CGAL, the Computational Geometry Algorithms Library.
CGAL-3.9-beta1 is a public testing release. It should provide
a solid ground to report bugs that need to be tackled before the
release of the final version of CGAL 3.9 end of September 2011.
Besides fixes to existing packages major features where added
in the following packages.
o Combinatorial Maps (new package)
This package provides a new combinatorial data structure allowing to
describe any orientable subdivided object whatever its dimension.
o 3D Convex Hull
The quickhull implementation of CGAL (CGAL::convex_hull_3) has been worked
out to provide much better performances
o 2D Arrangements
A new geometry-traits class that handles rational arcs has been
introduced. It replaced an old traits class, which handled the same
family of curves, but it was less efficient.
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations and Delaunay
triangulations in 2D and 3D, periodic triangulations),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh generation (2D, 3D and surface mesh generation,
surface mesh subdivision and parametrization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimization algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

97
Maintenance/public_release/announcement/CGAL-4.0
View File

@ -1,97 +0,0 @@
Subject: CGAL 4.0 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the release 4.0
of CGAL, the Computational Geometry Algorithms Library.
CGAL 4.0 differs from version 3.x in licensing, and in functionality.
We increased the major number of the CGAL version to '4' in order to
reflect this license change.
The license has been changed from LGPLv2.1 to LGPLv3+
(GNU Lesser General Public License) and from QPL (Q Public License v1.0)
to GPLv3+ (GNU Public License), depending on each package.
These license changes are not fundamental, that is, the licenses
are similar in their spirit, and the change reflects the fact
that the QPL has become marginal, since it had been introduced
and later abandoned for Qt.
Major changes in this release include the following:
o Linear Cell Complex (new package)
This package implements linear cell complexes, objects in
dimension d with linear geometry. They are based on the
Combinatorial Map where points are associated to vertices.
o 2D Voronoi Diagram Adaptor (temporarily removed)
As the copyright holder of this package has not granted
the right to switch from QPL to GPL, this package is
temporarily removed from the distribution.
o 2D and 3D Alpha Shapes
Make it more robust for the Exact_predicates_inexact_constructions_kernel
o AABB Tree, Spatial Searching
Queries on these data structures are now multi-thread safe.
o Surface Reconstruction from Point Sets,
Planar Parameterization of Triangulated Surface Meshes,
Approximation of Ridges and Umbilics on Triangulated Surface Meshes, and
Estimation of Local Differential Properties of Point-Sampled Surfaces
If you use the Eigen library (http://eigen.tuxfamily.org),
these packages no longer need Taucs, Lapack or Blas.
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations and Delaunay
triangulations in 2D and 3D, periodic triangulations),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh generation (2D, 3D and surface mesh generation,
surface mesh subdivision and parametrization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimization algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v3 or later versions).
Most modules are distributed under the terms of the GPL Open Source
license (GNU General Public License v3 or later versions).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

101
Maintenance/public_release/announcement/CGAL-4.0-beta1
View File

@ -1,101 +0,0 @@
Subject: CGAL 4.0 Beta 1 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the release 4.0 Beta 1
of CGAL, the Computational Geometry Algorithms Library.
Version 4.0 Beta 1 is a public testing release. It should provide
a solid ground to report bugs that need to be tackled before the
release of the final version of CGAL 4.0 beginning of March.
CGAL 4.0 differs from version 3.x in licensing, and in functionality.
We increased the major number of the CGAL version to '4' in order to
reflect this license change.
The license has been changed from LGPLv2.1 to LGPLv3+
(GNU Lesser General Public License) and from QPL (Q Public License v1.0)
to GPLv3+ (GNU Public License), depending on each package.
These license changes are not fundamental, that is, the licenses
are similar in their spirit, and the change reflects the fact
that the QPL has become marginal, since it had been introduced
and later abandoned for Qt.
Major changes in this release include the following:
o Linear Cell Complex (new package)
This package implements linear cell complexes, objects in
dimension d with linear geometry. They are based on the
Combinatorial Map where points are associated to vertices.
o 2D Voronoi Diagram Adaptor (temporarily removed)
As the copyright holder of this package has not granted
the right to switch from QPL to GPL, this package is
temporarily removed from the distribution.
o 2D and 3D Alpha Shapes
Make it more robust for the Exact_predicates_inexact_constructions_kernel
o AABB Tree, Spatial Searching
Queries on these data structures are now multi-thread safe.
o Surface Reconstruction from Point Sets,
Planar Parameterization of Triangulated Surface Meshes,
Approximation of Ridges and Umbilics on Triangulated Surface Meshes, and
Estimation of Local Differential Properties of Point-Sampled Surfaces
If you use the Eigen library (http://eigen.tuxfamily.org),
these packages no longer need Taucs, Lapack or Blas.
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations and Delaunay
triangulations in 2D and 3D, periodic triangulations),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh generation (2D, 3D and surface mesh generation,
surface mesh subdivision and parametrization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
range and segment trees),
- interpolation (natural neighbor interpolation and placement of
streamlines),
- optimization algorithms (smallest enclosing sphere of points or
spheres, smallest enclosing ellipsoid of points, principal
component analysis),
- kinetic data structures
Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v3 or later versions).
Most modules are distributed under the terms of the GPL Open Source
license (GNU General Public License v3 or later versions).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

69
Maintenance/public_release/announcement/CGAL-4.0.1
View File

@ -1,69 +0,0 @@
Subject: CGAL 4.0.1 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the release 4.0.1
of CGAL, the Computational Geometry Algorithms Library.
Version 4.0.1 is a bug-fix release for version 4.0. Apart various minor
fixes in the documentation, the following has been changed since CGAL-4.0:
* 2D Voronoi Diagram Adaptor (re-added)
- The package 2D Voronoi Diagram Adaptor was temporarily removed from the
CGAL distribution because of license issues. That package is now back into
CGAL.
* 2D and 3D Geometry Kernel
- Fix a bug in the Segment_3-Triangle_3 intersection function in the case
the segment is collinear with a triangle edge.
* Algebraic Kernel
- Avoid the linking error "duplicate symbols" when two compilation units
using the algebraic kernel are linked.
* 3D Boolean Operations on Nef Polygons Embedded on the Sphere
- Fix a memory leak due to the usage of an internal mechanism that has been
replaced by boost::any. This also influences the packages 2D Boolean
Operations on Nef Polygons, 3D Boolean Operations on Nef Polyhedra, Convex
Decomposition of Polyhedra, and 3D Minkowski Sum of Polyhedra.
* 2D Arrangement
- Fix several memory leaks.
* 2D Mesh Generation
- Fix a compilation error in the header <CGAL/Mesh_2/Do_not_refine_edges.h>
when g++ version 4.7 is used.
* Surface Mesh Generation and 3D Mesh Generation
- Fix an important bug in the CGAL_ImageIO library, that could lead to wrong
result when meshing from a 3D image.
- Fix the compilation of the demo in demo/Surface_mesher, when Boost version
1.48 or 1.49 is used.
* 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 that class in the package Surface Reconstruction
from Point Sets.
For further information and for downloading the library and its
documentation, please visit the CGAL web site: http://www.cgal.org/

10
Maintenance/public_release/announcement/CGAL-4.0.2
View File

@ -1,10 +0,0 @@
Subject: CGAL 4.0.2 Released, Computational Geometry Algorithms Library
Body:
Dear CGAL users,
Yesterday, I have published a buggy release 4.0.1, where a bug in the
CMakeLists.txt for CGAL prevented even to build the CGAL libraries. That
bug slipped through our automatic tests.
I have just published a new release 4.0.2 which fixes this problem.

6
Maintenance/public_release/announcement/CGAL-4.1 → Maintenance/public_release/announcement/mailing
View File

@ -1,11 +1,11 @@
Subject: CGAL 4.1 Released, Computational Geometry Algorithms Library
Subject: CGAL 4.2 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the release 4.1
The CGAL Open Source Project is pleased to announce the release 4.2
of CGAL, the Computational Geometry Algorithms Library.
Besides fixes to existing packages, the following has changed since
CGAL 4.1:
CGAL 4.2:
o New compiler support

10
Maintenance/public_release/announcement/CGAL-4.1-beta1 → Maintenance/public_release/announcement/mailing-beta
View File

@ -1,16 +1,16 @@
Subject: CGAL 4.1 Beta 1 Released, Computational Geometry Algorithms Library
Subject: CGAL 4.2 Beta 1 Released, Computational Geometry Algorithms Library
Body:
The CGAL Open Source Project is pleased to announce the release 4.1 Beta 1
The CGAL Open Source Project is pleased to announce the release 4.2 Beta 1
of CGAL, the Computational Geometry Algorithms Library.
CGAL version 4.1 Beta 1 is a public testing release. It should provide
CGAL version 4.2 Beta 1 is a public testing release. It should provide
a solid ground to report bugs that need to be tackled before the
release of the final version of CGAL 4.1 mid-September.
release of the final version of CGAL 4.2 mid-March.
Besides fixes to existing packages, the following has changed since
CGAL 4.1:
CGAL 4.2:
o New compiler support