|
The regular triangulation of a set of weighted points does not necessarily have one vertex for each of the input points. Some of the input weigthed points have no cell in the dual power diagrams and therefore do not correspond to a vertex of the regular triangulation. Those weighted points are said to be hidden points. A point which is hidden at a given time may appear later as a vertex of the regular triangulation upon removal on some other weighted point. Therefore, hidden points have to be stored somewhere. The regular triangulation store those hidden points in its cells.
A hidden point can appear as vertex of the triangulation only when the three dimensional cell where its point component is located (the cell which hides it) is removed. Therefore we decided to store in each cell of a regular triangulation the list of hidden points that are located in the face. Thus points hidden by a face are easily reinserted in the triangulation when the face is removed.
The base cell of a regular triangulation has to be a model of the concept RegularTriangulationCellBase_3 , which refines the concept TriangulationCellBase_3 by adding in the cell a container to store hidden points.
|
| |
|
Must be the same as the point type TriangulationTraits_3::Point_3
defined by the geometric traits class of the triangulation.
| |
|
| |
|
Iterator of value type Point
| |
|
|
| |
| Returns an iterator pointing to the first hidden point. | ||
|
|
| |
| Returns a past-the-end iterator. | ||
|
|
| |
| Adds p to the set of hidden points of the cell. | ||