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

Add 2D Polyline Simplification; fix the description of Surface_mesh

This commit is contained in:
Andreas Fabri 2015-02-25 11:40:36 +01:00
parent fd48532028
commit 04fdf00d76
4 changed files with 27 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
Installation/changes.html
View File

@ -118,9 +118,18 @@ 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
<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>
@ -139,9 +148,9 @@ 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>
<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>

8
Maintenance/public_release/announcement/mailing.eml
View File

@ -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)

2
Polyline_simplification_2/doc/Polyline_simplification_2/PackageDescription.txt
View File

@ -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

4
Surface_mesh/doc/Surface_mesh/PackageDescription.txt
View File

@ -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,