mirror of https://github.com/CGAL/cgal
Add 2D Polyline Simplification; fix the description of Surface_mesh
This commit is contained in:
parent
fd48532028
commit
04fdf00d76
|
|
@ -118,11 +118,20 @@ and <code>src/</code> directories).
|
|||
|
||||
<!-- Installation (and general changes) -->
|
||||
<!-- New packages -->
|
||||
<h3>2D Polyline Simplification (new package)</h3>
|
||||
<ul>
|
||||
<li>This package enables to simplify polylines with the guarantee
|
||||
that the topology of the polylines does not change. This can be
|
||||
done for a single polyline as well as for a set of polyline
|
||||
constraints in a constrained triangulation. The simplification
|
||||
can be controlled with cost and stop functions.</li>
|
||||
</ul>
|
||||
|
||||
<h3>2D Generalized Barycentric Coordinates (new package)</h3>
|
||||
<ul>
|
||||
<li> This package offers an efficient and robust implementation of
|
||||
two-dimensional closed-form generalized barycentric coordinates
|
||||
defined for simple two-dimensional polygons.</li>
|
||||
<li>This package offers an efficient and robust implementation of
|
||||
two-dimensional closed-form generalized barycentric coordinates
|
||||
defined for simple two-dimensional polygons.</li>
|
||||
</ul>
|
||||
|
||||
<h3>Scale-Space Surface Reconstruction (new package)</h3>
|
||||
|
|
@ -139,10 +148,10 @@ and <code>src/</code> directories).
|
|||
|
||||
<h3>Surface Mesh (new package)</h3>
|
||||
<ul>
|
||||
<li>The surface mesh class provided by this package is a data structure
|
||||
that can be used as halfedge data structure or polyhedral surface. It
|
||||
is an alternative to the packages <code>CGAL::Polyhedron_3</code>
|
||||
and <code>CGAL::HalfedgeDS</code>. </li>
|
||||
<li>The surface mesh class provided by this package is an implementation
|
||||
of the halfedge data structure allowing to represent polyhedral surfaces.
|
||||
It is an alternative to the packages <code>CGAL::Polyhedron_3</code>
|
||||
and <code>CGAL::HalfedgeDS</code>. </li>
|
||||
</ul>
|
||||
|
||||
<h3>Triangulation (new package)</h3>
|
||||
|
|
|
|||
|
|
@ -8,6 +8,14 @@ of CGAL, the Computational Geometry Algorithms Library.
|
|||
Besides fixes to existing packages, the following has changed since
|
||||
CGAL 4.5:
|
||||
|
||||
o 2D Polyline Simplification (new package)
|
||||
|
||||
This package enables to simplify polylines with the guarantee
|
||||
that the topology of the polylines does not change. This can be
|
||||
done for a single polyline as well as for a set of polyline
|
||||
constraints in a constrained triangulation. The simplification
|
||||
can be controlled with cost and stop functions.
|
||||
|
||||
|
||||
o 2D Generalized Barycentric Coordinates (new package)
|
||||
|
||||
|
|
|
|||
|
|
@ -17,7 +17,7 @@
|
|||
\cgalPkgPicture{PolylineSimplification-small.png}
|
||||
\cgalPkgSummaryBegin
|
||||
\cgalPkgAuthor{Andreas Fabri}
|
||||
\cgalPkgDesc{This package allows to simplify polylines with the guarantee that the topology of the polylines does not change. This can be done for a single polyline as well as for a set of polyline constraints in a constrained triangulation. The simplification can be controlled with cost and stop functions.}
|
||||
\cgalPkgDesc{This package enables to simplify polylines with the guarantee that the topology of the polylines does not change. This can be done for a single polyline as well as for a set of polyline constraints in a constrained triangulation. The simplification can be controlled with cost and stop functions.}
|
||||
\cgalPkgManuals{Chapter_2D_Polyline_simplification,PkgPolylineSimplification2}
|
||||
\cgalPkgSummaryEnd
|
||||
\cgalPkgShortInfoBegin
|
||||
|
|
|
|||
|
|
@ -7,8 +7,8 @@
|
|||
\cgalPkgPicture{Surface_mesh_teaser.png}
|
||||
\cgalPkgSummaryBegin
|
||||
\cgalPkgAuthor{Mario Botsch, Daniel Sieger, Philipp Moeller, and Andreas Fabri}
|
||||
\cgalPkgDesc{The surface mesh class provided by this package is a data structure
|
||||
that can be used as halfedge data structure or polyhedral surface. It is
|
||||
\cgalPkgDesc{The surface mesh class provided by this package is an implementation
|
||||
of the halfedge data structure allowing to represent polyhedral surfaces. It is
|
||||
an alternative to the packages \ref PkgHDSSummary and \ref PkgPolyhedronSummary.
|
||||
The main differences are that it is indexed based and not pointer based,
|
||||
and that the mechanism for adding information to vertices, halfedges, edges,
|
||||
|
|
|
|||
Loading…
Reference in New Issue