mirror of https://github.com/CGAL/cgal
small doc changes
This commit is contained in:
parent
5b21794bf6
commit
95556e2359
|
|
@ -3,9 +3,7 @@
|
||||||
\cgalConcept
|
\cgalConcept
|
||||||
|
|
||||||
The concept `GetFilter` describes the requirements for the <I>policy
|
The concept `GetFilter` describes the requirements for the <I>policy
|
||||||
function object</I> which gets the <I>collapse placement</I> of an edge,
|
function object</I> which gets the profile and placement of an edge.
|
||||||
that is, the new position of the vertex that remains after a
|
|
||||||
halfedge-collapse operation.
|
|
||||||
|
|
||||||
The placement returned is a `boost::optional` value (i.e., it can
|
The placement returned is a `boost::optional` value (i.e., it can
|
||||||
be absent). The value `boost::none` indicates that the edge should not be collapsed.
|
be absent). The value `boost::none` indicates that the edge should not be collapsed.
|
||||||
|
|
@ -36,4 +34,4 @@ public:
|
||||||
|
|
||||||
/// @}
|
/// @}
|
||||||
|
|
||||||
}; /* end GetPlacement */
|
}; /* end Filter */
|
||||||
|
|
|
||||||
|
|
@ -215,7 +215,7 @@ On the one hand, this dramatically saves on memory but on the other hand is
|
||||||
a processing waste because when an edge is effectively collapsed, `GetPlacement`
|
a processing waste because when an edge is effectively collapsed, `GetPlacement`
|
||||||
must be called <I>again</I> to know were to move the remaining vertex.
|
must be called <I>again</I> to know were to move the remaining vertex.
|
||||||
|
|
||||||
Earlier prototypes shown that attaching the placement to the edge, thus avoiding one
|
Earlier prototypes showed that attaching the placement to the edge, thus avoiding one
|
||||||
redundant call to the placement function after the edge collapsed, has little
|
redundant call to the placement function after the edge collapsed, has little
|
||||||
impact on the total running time. This is because the cost of an each edge is not just
|
impact on the total running time. This is because the cost of an each edge is not just
|
||||||
computed once but changes several times during the process so the placement function
|
computed once but changes several times during the process so the placement function
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue