Merge branch 'master' of ssh://scm.cgal.org/var/git/cgal

This commit is contained in:
Andreas Fabri 2013-03-17 21:45:10 +01:00
commit 492db70730
76 changed files with 2347 additions and 186 deletions

2
.gitignore vendored
View File

@ -289,12 +289,14 @@ Maintenance/infrastructure/*/reference-platforms/*/CMakeCache.txt.backup
Maintenance/infrastructure/*/reference-platforms/*/cmake_install.cmake
Maintenance/infrastructure/*/reference-platforms/*/config
Maintenance/infrastructure/*/reference-platforms/*/include
Maintenance/infrastructure/*/reference-platforms/*/Installation
Maintenance/infrastructure/*/reference-platforms/*/lib
Maintenance/infrastructure/*/reference-platforms/*/localbuildscript
Maintenance/infrastructure/*/reference-platforms/*/localtestscript
Maintenance/infrastructure/*/reference-platforms/*/localtestscript-redo-results-collection
Maintenance/infrastructure/*/reference-platforms/*/Makefile
Maintenance/infrastructure/*/reference-platforms/*/src
Maintenance/infrastructure/*/reference-platforms/*/VERSION
Manual_tools/doc_tex/cc_manual.pdf
Manual_tools/doc_tex/cc_manual.ps.gz
Manual_tools/doc_tex/cc_manual_index.pdf

View File

@ -5,7 +5,7 @@ namespace CGAL {
`Arr_face_index_map` maintains a mapping of face handles of an
attached arrangement object to indices (of type `unsigned int`).
This class template is a model of the `boost` concept
This class template is a model of the concept
`ReadablePropertyMap`. A mapping between face handles and indices
enables convenient usage of property-map classes supplied by `boost`.
For example, the property-map class templates
@ -22,7 +22,7 @@ to dynamically maintain the mapping of face handles to indices.
\cgalModels DefaultConstructible
\cgalModels CopyConstructible
\cgalModels Assignable
\cgalModels `boost::ReadablePropertyMap`
\cgalModels `ReadablePropertyMap`
\sa `Arr_observer<Arrangement>`
\sa `Arr_vertex_index_map<Arrangement>`

View File

@ -5,7 +5,7 @@ namespace CGAL {
`Arr_vertex_index_map` maintains a mapping of vertex handles of an
attached arrangement object to indices (of type `unsigned int`).
This class template is a model of the `boost` concept
This class template is a model of the concept
`ReadablePropertyMap`. A mapping between vertex handles and indices
enables convenient usage of property-map classes supplied by `boost`.
For example, the property-map class templates
@ -22,7 +22,7 @@ to dynamically maintain the mapping of vertex handles to indices.
\cgalModels DefaultConstructible
\cgalModels CopyConstructible
\cgalModels Assignable
\cgalModels `boost::ReadablePropertyMap`
\cgalModels `ReadablePropertyMap`
\sa `Arr_observer<Arrangement>`
\sa `Arr_face_index_map<Arrangement>`

View File

@ -1,6 +1,4 @@
/// \defgroup PkgCGALIpelets CGAL Ipelets Reference
/// \defgroup PkgCGALIpeletsConcepts Concepts
/// \ingroup PkgCGALIpelets
/*!
\addtogroup PkgCGALIpelets
\cgalPkgDescriptionBegin{CGAL Ipelets,PkgCGALIpeletsSummary}

View File

@ -88,6 +88,24 @@ See http://www.boost.org/libs/property_map/doc/LvaluePropertyMap.html
*/
class LvaluePropertyMap {};
/*!
See http://www.boost.org/libs/property_map/doc/ReadWritePropertyMap.html
/// \cgalConcept
*/
class ReadWritePropertyMap {};
/*!
See http://www.boost.org/libs/property_map/doc/WritablePropertyMap.html
/// \cgalConcept
*/
class WritablePropertyMap {};
/*!
See http://www.boost.org/libs/property_map/doc/ReadablePropertyMap.html
/// \cgalConcept
*/
class ReadablePropertyMap {};
/*!
This specifies that the actual type exposed through a `typedef` is
implementation specific. It can only be treated through the concepts

View File

@ -1039,6 +1039,7 @@ namespace for the XML file to be processed properly. -->
</list>
<list name="TAGFILES" append="true">
<item>./tags/Polygon.tag=../../CGAL.CGAL.2D-Polygons/html</item>
</list>
</doxygen>
</project>

View File

@ -1,6 +1,4 @@
/// \defgroup PkgGeomview Geomview Reference
/// \defgroup PkgGeomviewConcepts Concepts
/// \ingroup PkgGeomview
/*!
\addtogroup PkgGeomview
\todo check generated documentation

View File

@ -45,7 +45,7 @@ the possible return values wrapped in `Object` are the following:
<TR>
<TD VALIGN="CENTER" > Line_d </TD>
<TD VALIGN="CENTER" > Line_d </TD>
<TD><TABLE>
<TD><TABLE BORDER="0">
<TR><TD>Point_d</TD></TR>
<TR><TD>Line_d</TD></TR>
</TABLE></TD>
@ -53,7 +53,7 @@ the possible return values wrapped in `Object` are the following:
<TR>
<TD VALIGN="CENTER" > Segment_d </TD>
<TD VALIGN="CENTER" > Line_d </TD>
<TD><TABLE>
<TD><TABLE BORDER="0">
<TR><TD>Point_d</TD></TR>
<TR><TD>Segment_d</TD></TR>
</TABLE></TD>
@ -61,7 +61,7 @@ the possible return values wrapped in `Object` are the following:
<TR>
<TD VALIGN="CENTER" > Segment_d </TD>
<TD VALIGN="CENTER" > Segment_d </TD>
<TD><TABLE>
<TD><TABLE BORDER="0">
<TR><TD>Point_d</TD></TR>
<TR><TD>Segment_d</TD></TR>
</TABLE></TD>
@ -69,7 +69,7 @@ the possible return values wrapped in `Object` are the following:
<TR>
<TD VALIGN="CENTER" > Ray_d </TD>
<TD VALIGN="CENTER" > Line_d </TD>
<TD><TABLE>
<TD><TABLE BORDER="0">
<TR><TD>Point_d</TD></TR>
<TR><TD>Ray_d</TD></TR>
</TABLE></TD>
@ -77,7 +77,7 @@ the possible return values wrapped in `Object` are the following:
<TR>
<TD VALIGN="CENTER" > Ray_d </TD>
<TD VALIGN="CENTER" > Segment_d </TD>
<TD><TABLE>
<TD><TABLE BORDER="0">
<TR><TD>Point_d</TD></TR>
<TR><TD>Segment_d</TD></TR>
</TABLE></TD>
@ -85,7 +85,7 @@ the possible return values wrapped in `Object` are the following:
<TR>
<TD VALIGN="CENTER" > Ray_d </TD>
<TD VALIGN="CENTER" > Ray_d </TD>
<TD><TABLE>
<TD><TABLE BORDER="0">
<TR><TD>Point_d</TD></TR>
<TR><TD>Segment_d</TD></TR>
<TR><TD>Ray_d</TD></TR>
@ -94,7 +94,7 @@ the possible return values wrapped in `Object` are the following:
<TR>
<TD VALIGN="CENTER" > Hyperplane_d </TD>
<TD VALIGN="CENTER" > Line_d </TD>
<TD><TABLE>
<TD><TABLE BORDER="0">
<TR><TD>Point_d</TD></TR>
<TR><TD>Line_d</TD></TR>
</TABLE></TD>
@ -102,7 +102,7 @@ the possible return values wrapped in `Object` are the following:
<TR>
<TD VALIGN="CENTER" > Hyperplane_d </TD>
<TD VALIGN="CENTER" > Ray_d </TD>
<TD><TABLE>
<TD><TABLE BORDER="0">
<TR><TD>Point_d</TD></TR>
<TR><TD>Ray_d</TD></TR>
</TABLE></TD>
@ -110,7 +110,7 @@ the possible return values wrapped in `Object` are the following:
<TR>
<TD VALIGN="CENTER" > Hyperplane_d </TD>
<TD VALIGN="CENTER" > Segment_d </TD>
<TD><TABLE>
<TD><TABLE BORDER="0">
<TR><TD>Point_d</TD></TR>
<TR><TD>Segment_d</TD></TR>
</TABLE></TD>

View File

@ -3,8 +3,6 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Affine_rank_d {

View File

@ -2,9 +2,6 @@
/*!
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Affinely_independent_d {

View File

@ -2,15 +2,12 @@
/*!
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Center_of_sphere_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Compare_lexicographically_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Component_accessor_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Compute_coordinate_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,8 +3,6 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
\cgalRefines `AdaptableFunctor` (with one argument)
\sa `Kernel_d::CartesianConstIterator_d`
@ -12,6 +10,11 @@ A model for this must provide:
*/
class Kernel_d::ConstructCartesianConstIterator_d {
public:
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!
returns an iterator on the 0'th %Cartesian coordinate of `p`.
*/
@ -24,5 +27,7 @@ returns the past the end iterator of the %Cartesian coordinates of `p`.
Kernel_d::Cartesian_const_iterator_d operator()(const Kernel_d::Point_d
&p, int);
/// @}
}; /* end Kernel_d::ConstructCartesianConstIterator_d */

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Contained_in_affine_hull_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Contained_in_linear_hull_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Contained_in_simplex_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Equal_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Has_on_positive_side_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Intersect_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Less_coordinate_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Less_lexicographically_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Less_or_equal_lexicographically_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Lift_to_paraboloid_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Linear_base_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Linear_rank_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Linearly_independent_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Midpoint_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Orientation_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Oriented_side_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Orthogonal_vector_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Point_dimension_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Point_of_sphere_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Point_to_vector_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Project_along_d_axis_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Side_of_bounded_sphere_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Side_of_oriented_sphere_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Squared_distance_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Value_at_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -3,14 +3,13 @@
\ingroup PkgKernelDKernelConcept
\cgalConcept
A model for this must provide:
*/
class Kernel_d::Vector_to_point_d {
public:
/// \name See Also
/// \name Operations
/// A model of this concept must provide:
/// @{
/*!

View File

@ -19,11 +19,11 @@ LC_CTYPE=en_US.UTF-8
# The script also updates the manual tools.
# "master" alone
0 21 * * Thu cd $HOME/CGAL/create_internal_release && $HOME/bin/create_release $HOME/CGAL/branches/master.git --public --do-it
0 21 * * Sat cd $HOME/CGAL/create_internal_release && $HOME/bin/create_release $HOME/CGAL/branches/master.git --public --do-it
# "integration"
0 21 * * Mon,Tue,Wed,Fri,Sat cd $HOME/CGAL/create_internal_release && $HOME/bin/create_release $HOME/CGAL/branches/integration.git $HOME/CGAL/branches/empty-dir --public --do-it
0 21 * * Mon,Tue,Wed,Thu,Fri,Sun cd $HOME/CGAL/create_internal_release && $HOME/bin/create_release $HOME/CGAL/branches/integration.git $HOME/CGAL/branches/empty-dir --public --do-it
# from branch 4.1
0 21 * * Sun cd $HOME/CGAL/create_internal_release-4.1-branch && $HOME/bin/create_release $HOME/CGAL/branches/CGAL-4.1-branch.git --public --do-it
#0 21 * * Sun cd $HOME/CGAL/create_internal_release-4.1-branch && $HOME/bin/create_release $HOME/CGAL/branches/CGAL-4.1-branch.git --public --do-it
# "next" alone

View File

@ -14,7 +14,7 @@ CGAL_ROOT=/no-raid$HOME/CGAL
LOGS_DIR="${CGAL_ROOT}/AUTOTEST_LOGS"
LOCK_FILE="${CGAL_ROOT}/autotest_cgal_with_cmake.lock"
COMPILERS_localhost="x86-64_Linux-Fedora16_g++-4.6.2 x86-64_Linux-Fedora16_g++-4.6.2_ansi x86-64_Linux-Fedora16_g++-4.6.2_m32 x86-64_Linux-Fedora16_g++-4.6.2_MATCHING-BUG-6 x86-64_Linux-Fedora16_g++-4.6.2_Release x86-64_Linux-Fedora16_g++-4.5-branch_CXX0X x86-64_Linux-Fedora16_g++-4.5-branch_Release x86-64_Linux-Fedora16_IntelCompiler-12.0-with-g++-4.6.2 x86-64_Linux-Fedora16_IntelCompiler-12.0-with-g++-4.6.2_strict-ansi x86-64_Linux-Fedora16_g++-trunk_CXX0X x86-64_Linux-Fedora16_llvm-clang-with-g++-4.6.2 x86-64_Linux-Fedora16_g++-4.6.2_CXXDEBUG x86-64_Linux-Fedora16_IntelCompiler-13.1-with-g++-4.6.3-STL"
COMPILERS_localhost="x86-64_Linux-Fedora16_g++-4.6.2 x86-64_Linux-Fedora16_g++-4.6.2_ansi x86-64_Linux-Fedora16_g++-4.6.2_m32 x86-64_Linux-Fedora16_g++-4.6.2_MATCHING-BUG-6 x86-64_Linux-Fedora16_g++-4.6.2_Release x86-64_Linux-Fedora16_g++-4.6.2_LEDA x86-64_Linux-Fedora16_g++-4.5-branch_CXX0X x86-64_Linux-Fedora16_g++-4.5-branch_Release x86-64_Linux-Fedora16_IntelCompiler-12.0-with-g++-4.6.2 x86-64_Linux-Fedora16_IntelCompiler-12.0-with-g++-4.6.2_strict-ansi x86-64_Linux-Fedora16_g++-trunk_CXX0X x86-64_Linux-Fedora16_llvm-clang-with-g++-4.6.2 x86-64_Linux-Fedora16_g++-4.6.2_CXXDEBUG x86-64_Linux-Fedora16_IntelCompiler-13.1-with-g++-4.6.3-STL"
BUILD_ON_localhost=all
REFERENCE_PLATFORMS_DIR=$HOME/infrastructure/reference-platforms

View File

@ -0,0 +1,14 @@
export QTDIR=/usr/lib64/qt-3.3
source /home/lrineau/CGAL/MPFI-RS/setup-rs
source /home/lrineau/CGAL/CGAL-I-REF/cmake/platforms/setup-common
BOOST_ROOT=/home/lrineau/CGAL/boost/boost-release-branch
export BOOST_ROOT
CXXFLAGS=-I$BOOST_ROOT/include
LEDA_DIR=/home/lrineau/CGAL/LEDA-6.4-openSuse-12.1-g++-4.6.2-64bit-multithread-evaluation
export LEDA_DIR
CGAL_DISABLE_GMP=1
export CGAL_DISABLE_GMP

View File

@ -1,6 +1,4 @@
/// \defgroup PkgNef3 3D Boolean Operations on Nef Polyhedra Reference
/// \defgroup PkgNef3Concepts Concepts
/// \ingroup PkgNef3
///
/// \defgroup PkgNef3IOFunctions I/O Functions
/// \ingroup PkgNef3

View File

@ -1,6 +1,4 @@
/// \defgroup PkgNefS2 2D Boolean Operations on Nef Polygons Embedded on the Sphere Reference
/// \defgroup PkgNefS2Concepts Concepts
/// \ingroup PkgNefS2
/*!
\addtogroup PkgNefS2

View File

@ -46,9 +46,9 @@ namespace CGAL {
/// Faces are ignored.
///
/// @tparam OutputIterator iterator over output points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/WritablePropertyMap.html">boost::WritablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `WritablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if OutputIterator value_type is convertible to Point_3<Kernel>.
/// @tparam NormalPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/WritablePropertyMap.html">boost::WritablePropertyMap</a> with a value_type = Vector_3<Kernel>.
/// @tparam NormalPMap is a model of `WritablePropertyMap` with a value_type = Vector_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.
///
@ -202,7 +202,7 @@ read_off_points_and_normals(
/// Faces are ignored.
///
/// @tparam OutputIterator iterator over output points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/WritablePropertyMap.html">boost::WritablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `WritablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if OutputIterator value_type is convertible to Point_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -47,9 +47,9 @@ namespace CGAL {
/// Empty lines and comments starting by # character are allowed.
///
/// @tparam OutputIterator iterator over output points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/WritablePropertyMap.html">boost::WritablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `WritablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if OutputIterator value_type is convertible to Point_3<Kernel>.
/// @tparam NormalPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/WritablePropertyMap.html">boost::WritablePropertyMap</a> with a value_type = Vector_3<Kernel>.
/// @tparam NormalPMap is a model of `WritablePropertyMap` with a value_type = Vector_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.
///
@ -199,7 +199,7 @@ read_xyz_points_and_normals(
/// Empty lines and comments starting by # character are allowed.
///
/// @tparam OutputIterator iterator over output points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/WritablePropertyMap.html">boost::WritablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `WritablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if OutputIterator value_type is convertible to Point_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -45,9 +45,9 @@ namespace CGAL {
/// \pre normals must be unit vectors
///
/// @tparam ForwardIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if ForwardIterator value_type is convertible to Point_3<Kernel>.
/// @tparam NormalPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/WritablePropertyMap.html">boost::WritablePropertyMap</a> with a value_type = Vector_3<Kernel>.
/// @tparam NormalPMap is a model of `WritablePropertyMap` with a value_type = Vector_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.
///
@ -148,7 +148,7 @@ write_off_points_and_normals(
/// The function writes for each point a line with the x y z position.
///
/// @tparam ForwardIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if ForwardIterator value_type is convertible to Point_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -45,9 +45,9 @@ namespace CGAL {
/// \pre normals must be unit vectors
///
/// @tparam ForwardIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if ForwardIterator value_type is convertible to Point_3<Kernel>.
/// @tparam NormalPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/WritablePropertyMap.html">boost::WritablePropertyMap</a> with a value_type = Vector_3<Kernel>.
/// @tparam NormalPMap is a model of `WritablePropertyMap` with a value_type = Vector_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.
///
@ -143,7 +143,7 @@ write_xyz_points_and_normals(
/// The function writes for each point a line with the x y z position.
///
/// @tparam ForwardIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if ForwardIterator value_type is convertible to Point_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -71,7 +71,7 @@ struct Compare_iterator_address
/// and get() requires a lookup in the map.
///
/// @heading Is Model for the Concepts:
/// Model of the <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> concept.
/// Model of the `ReadablePropertyMap` concept.
///
/// @heading Parameters:
/// @param Iter iterator over input elements.

View File

@ -131,7 +131,7 @@ private:
/// (or in general an iterator over Point_with_normal_3 elements).
///
/// @heading Is Model for the Concepts:
/// Model of boost::LvaluePropertyMap concept.
/// Model of `LvaluePropertyMap` concept.
///
/// @heading Parameters:
/// @param Gt Geometric traits class.

View File

@ -98,7 +98,7 @@ compute_average_spacing(const typename Kernel::Point_3& query, ///< 3D point who
/// \pre `k >= 2.`
///
/// @tparam InputIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if InputIterator value_type is convertible to Point_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -136,7 +136,7 @@ public:
/// \pre `epsilon > 0`
///
/// @tparam ForwardIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if ForwardIterator value_type is convertible to Point_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -205,7 +205,7 @@ improved_jet_smooth_point(
/// \pre `k >= 2`
///
/// @tparam ForwardIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if ForwardIterator value_type is convertible to Point_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -188,7 +188,7 @@ improved_laplacian_smooth_point(
/// \pre `k >= 2`
///
/// @tparam ForwardIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if ForwardIterator value_type is convertible to Point_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -115,9 +115,9 @@ jet_estimate_normal(const typename Kernel::Point_3& query, ///< point to compute
/// \pre `k >= 2`
///
/// @tparam InputIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if InputIterator value_type is convertible to Point_3<Kernel>.
/// @tparam NormalPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/WritablePropertyMap.html">boost::WritablePropertyMap</a> with a value_type = Vector_3<Kernel>.
/// @tparam NormalPMap is a model of `WritablePropertyMap` with a value_type = Vector_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -115,7 +115,7 @@ jet_smooth_point(
/// \pre `k >= 2`
///
/// @tparam InputIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if InputIterator value_type is convertible to Point_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -130,7 +130,7 @@ public:
/// \pre `0 < angle_max <= PI/2`
///
/// @tparam ForwardIterator iterator over input points.
/// @tparam NormalPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadWritePropertyMap.html">boost::ReadWritePropertyMap</a>.
/// @tparam NormalPMap is a model of `ReadWritePropertyMap`.
/// @tparam Kernel Geometric traits class.
template <typename ForwardIterator, ///< Input point iterator
@ -190,8 +190,8 @@ private:
/// Orients the normal of the point with maximum Z towards +Z axis.
///
/// @tparam ForwardIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam NormalPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadWritePropertyMap.html">boost::ReadWritePropertyMap</a> with a value_type = Vector_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// @tparam NormalPMap is a model of `ReadWritePropertyMap` with a value_type = Vector_3<Kernel>.
/// @tparam Kernel Geometric traits class.
///
/// @return iterator over the top point.
@ -247,9 +247,9 @@ mst_find_source(
/// \pre `k >= 2`
///
/// @tparam ForwardIterator iterator over input points.
/// @tparam IndexPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with an integral value_type.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam NormalPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadWritePropertyMap.html">boost::ReadWritePropertyMap</a> with a value_type = Vector_3<Kernel>.
/// @tparam IndexPMap is a model of `ReadablePropertyMap` with an integral value_type.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// @tparam NormalPMap is a model of `ReadWritePropertyMap` with a value_type = Vector_3<Kernel>.
/// @tparam Kernel Geometric traits class.
///
/// @return the Riemannian graph
@ -387,9 +387,9 @@ create_riemannian_graph(
/// \pre Normals must be unit vectors.
///
/// @tparam ForwardIterator iterator over input points.
/// @tparam IndexPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with an integral value_type.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam NormalPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadWritePropertyMap.html">boost::ReadWritePropertyMap</a> with a value_type = Vector_3<Kernel>.
/// @tparam IndexPMap is a model of `ReadablePropertyMap` with an integral value_type.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// @tparam NormalPMap is a model of `ReadWritePropertyMap` with a value_type = Vector_3<Kernel>.
/// @tparam Kernel Geometric traits class.
///
/// @return the MST graph.
@ -499,9 +499,9 @@ create_mst_graph(
/// \pre `k >= 2`
///
/// @tparam ForwardIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if ForwardIterator value_type is convertible to Point_3<Kernel>.
/// @tparam NormalPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadWritePropertyMap.html">boost::ReadWritePropertyMap</a> with a value_type = Vector_3<Kernel>.
/// @tparam NormalPMap is a model of `ReadWritePropertyMap` with a value_type = Vector_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.
///

View File

@ -110,9 +110,9 @@ pca_estimate_normal(const typename Kernel::Point_3& query, ///< point to compute
/// \pre `k >= 2`
///
/// @tparam InputIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if InputIterator value_type is convertible to Point_3<Kernel>.
/// @tparam NormalPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/WritablePropertyMap.html">boost::WritablePropertyMap</a> with a value_type = Vector_3<Kernel>.
/// @tparam NormalPMap is a model of `WritablePropertyMap` with a value_type = Vector_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -111,7 +111,7 @@ pca_smooth_point(
/// \pre `k >= 2`
///
/// @tparam InputIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if InputIterator value_type is convertible to Point_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -40,9 +40,9 @@ namespace CGAL {
/// \pre normals must be unit vectors
///
/// @tparam ForwardIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if ForwardIterator value_type is convertible to Point_3<Kernel>.
/// @tparam NormalPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadWritePropertyMap.html">boost::ReadWritePropertyMap</a> with a value_type = Vector_3<Kernel>.
/// @tparam NormalPMap is a model of `ReadWritePropertyMap` with a value_type = Vector_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.
///

View File

@ -38,7 +38,7 @@ namespace CGAL {
/// For this reason it should not be called on sorted containers.
///
/// @tparam ForwardIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if ForwardIterator value_type is convertible to Point_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -112,7 +112,7 @@ compute_avg_knn_sq_distance_3(
/// \pre `k >= 2`
///
/// @tparam InputIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if InputIterator value_type is convertible to Point_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -109,7 +109,7 @@ compute_median_knn_sq_distance_3(
/// \pre `k >= 2`
///
/// @tparam InputIterator iterator over input points.
/// @tparam PointPMap is a model of <a href="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</a> with a value_type = Point_3<Kernel>.
/// @tparam PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3<Kernel>.
/// It can be omitted if InputIterator value_type is convertible to Point_3<Kernel>.
/// @tparam Kernel Geometric traits class.
/// It can be omitted and deduced automatically from PointPMap value_type.

View File

@ -3,8 +3,8 @@
\ingroup PkgRidges_3Concepts
\cgalConcept
The concept `Vertex2FTPropertyMap` specializes the concept of LvaluePropertyMap
of the Boost library. It is intended to be used in combination with
The concept `Vertex2FTPropertyMap` specializes the concept of `LvaluePropertyMap`.
It is intended to be used in combination with
the concept `TriangulatedSurfaceMesh` in the class
`CGAL::Ridge_approximation`. It associates a field type value
`TriangulatedSurfaceMesh::Traits::FT` to keys which are

View File

@ -3,8 +3,8 @@
\ingroup PkgRidges_3Concepts
\cgalConcept
The concept `Vertex2VectorPropertyMap` specializes the concept of LvaluePropertyMap
of the Boost library. It is intended to be used in combination with
The concept `Vertex2VectorPropertyMap` specializes the concept of `LvaluePropertyMap`.
It is intended to be used in combination with
the concept `TriangulatedSurfaceMesh` in the class
`CGAL::Ridge_approximation`. It associates a three dimensional vector
`TriangulatedSurfaceMesh::Traits::Vector_3` to keys which are

View File

@ -12,7 +12,7 @@ in a nearest neighbor search algorithm, this class must be used as distance.
`Key` is a type that is associated to a point of type `Base_distance::Point_d`.
`PointPropertyMap` is a model of <A HREF="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</A>
`PointPropertyMap` is a model of `ReadablePropertyMap`
with `Key` as `key_type` and `Base_distance::Point_d` as `value_type`.
`Base_distance` is a model of either `GeneralDistance` or `OrthogonalDistance`.
@ -84,7 +84,7 @@ must be used as distance.
`Key` is a type that is associated to a point of type `Base_distance::Point_d`.
`PointPropertyMap` is a model of <A HREF="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</A>
`PointPropertyMap` is a model of `ReadablePropertyMap`
with `Key` as `key_type` and `Base_distance::Point_d` as `value_type`.
`BaseTraits` is a model of either `SearchTraits` or `RangeSearchTraits`.

View File

@ -319,7 +319,7 @@ The point type of the search traits is `std::size_t`.
\subsection Spatial_searchingUsingaModelofLvalueProperty Using a Model of L-value Property Map Concept
This example programs uses a <span class="textsc">Boost</span> <A HREF="http://www.boost.org/doc/libs/release/libs/property_map/doc/LvaluePropertyMap.html">LvaluePropertyMap</A>.
This example programs uses a model of `LvaluePropertyMap`.
Points are read from a `std::map`. The search tree stores integers of type `std::size_t`. The value type of the iterator of the neighbor searching algorithm is `std::size_t`.
\cgalExample{Spatial_searching/searching_with_point_with_info_pmap.cpp}

View File

@ -10,7 +10,7 @@ while the actual point type is `Base_traits::Point_2`.
\tparam Base_traits must be a model for `SpatialSortingTraits_2`.
\tparam PointPropertyMap must be a model of <A HREF="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</A>
\tparam PointPropertyMap must be a model of `ReadablePropertyMap`
with value type `Base_traits::Point_2`.
\cgalModels `SpatialSortingTraits_2`

View File

@ -10,7 +10,7 @@ while the actual point type is `Base_traits::Point_3`.
\tparam Base_traits must be a model for `SpatialSortingTraits_3`.
\tparam PointPropertyMap must be a model of <A HREF="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</A>
\tparam PointPropertyMap must be a model of `ReadablePropertyMap`
with value type `Base_traits::Point_3`.
\cgalModels `SpatialSortingTraits_3`

View File

@ -10,7 +10,7 @@ while the actual point type is `Base_traits::Point_d`.
\tparam Base_traits must be a model for `SpatialSortingTraits_d`.
\tparam PointPropertyMap must be a model of <A HREF="http://www.boost.org/doc/libs/release/libs/property_map/doc/ReadablePropertyMap.html">boost::ReadablePropertyMap</A>
\tparam PointPropertyMap must be a model of `ReadablePropertyMap`
with value type `Base_traits::Point_d`.
\cgalModels `SpatialSortingTraits_d`

View File

@ -46,8 +46,8 @@ function designates which formal argument it is.
Maps each vertex in the surface into an unsigned integer number
in the range `[0,num_vertices(surface))`.
`VertexIndexMap` must be a
<A HREF="http://www.boost.org/libs/property_map/doc/ReadablePropertyMap.html">ReadablePropertyMap</A>
`VertexIndexMap` must be a model of
`ReadablePropertyMap`
whose `key_type` is
`boost::graph_traits<EdgeCollapsableMesh const>::%vertex_descriptor`
and whose `value_type` is
@ -67,9 +67,8 @@ a property map which non-intrusively associates a proper id with each vertex.
Maps each <I>directed</I> edge in the surface into an unsigned integer number
in the range `[0,num_edges(surface))`.
`EdgeIndexMap` must be a
<A HREF="http://www.boost.org/libs/property_map/doc/ReadablePropertyMap.html">ReadablePropertyMap</A>
whose `key_type` is
`EdgeIndexMap` must be a model of
`ReadablePropertyMap` whose `key_type` is
`boost::graph_traits<EdgeCollapsableMesh const>::%edge_descriptor`
and whose `value_type` is
`boost::graph_traits<EdgeCollapsableMesh>::%size_type`
@ -88,9 +87,8 @@ a property map which non-intrusively associates a proper id with each edge.
Maps each <I>directed</I> edge in the surface into a Boolean value
which indicates if the edge belongs to the boundary of the surface
(facing the outside).
`EdgeIsBorderMap` must be a
<A HREF="http://www.boost.org/libs/property_map/doc/ReadablePropertyMap.html">ReadablePropertyMap</A>
whose `key_type` is
`EdgeIsBorderMap` must be a model
`ReadablePropertyMap` whose `key_type` is
`boost::graph_traits<EdgeCollapsableMesh const>::%edge_descriptor`
and whose `value_type` is `bool`.

View File

@ -283,11 +283,11 @@ public:
\tparam InputIterator iterator over input points.
\tparam PointPMap is a model of `boost::ReadablePropertyMap` with
\tparam PointPMap is a model of `ReadablePropertyMap` with
a `value_type = Point`. It can be omitted if `InputIterator`
`value_type` is convertible to `Point`.
\tparam NormalPMap is a model of `boost::ReadablePropertyMap`
\tparam NormalPMap is a model of `ReadablePropertyMap`
with a `value_type = Vector`.
*/
template <typename InputIterator,

View File

@ -357,9 +357,9 @@ public:
///
/// @commentheading Template Parameters:
/// @param InputIterator iterator over input points.
/// @param PointPMap is a model of boost::ReadablePropertyMap with a value_type = Point_3.
/// @param PointPMap is a model of `ReadablePropertyMap` with a value_type = Point_3.
/// It can be omitted if InputIterator value_type is convertible to Point_3.
/// @param NormalPMap is a model of boost::ReadablePropertyMap with a value_type = Vector_3.
/// @param NormalPMap is a model of `ReadablePropertyMap` with a value_type = Vector_3.
///
/// @return the number of inserted points.