#include <CGAL/Regular_triangulation_cell_base_3.h>
Inherits Cb.
|
Not every weighted point inserted in a regular triangulation necessarily appears in the triangulation.
If the weight of a point is too small compared to other points, it might be hidden. These hidden vertices are stored in a unique corresponding cell (defined through v->cell()). The following functions provide set and get functionalities.
|
Point_iterator | hidden_points_begin () |
| Returns an iterator pointing to the first hidden point. More...
|
|
Point_iterator | hidden_points_end () |
| Returns a past-the-end iterator. More...
|
|
void | hide_point (const Point &p) |
| Adds p to the set of hidden points of the cell. More...
|
|
const Point_3 & | weighted_circumcenter (const Traits >=Traits()) const |
| Returns the weighted circumcenter of the cell. More...
|
|
◆ Point
template<typename Traits , typename Cb >
◆ Point_3
template<typename Traits , typename Cb >
◆ Point_container
template<typename Traits , typename Cb >
◆ Point_iterator
template<typename Traits , typename Cb >
◆ hidden_points_begin()
template<typename Traits , typename Cb >
Returns an iterator pointing to the first hidden point.
◆ hidden_points_end()
template<typename Traits , typename Cb >
Returns a past-the-end iterator.
◆ hide_point()
template<typename Traits , typename Cb >
Adds p
to the set of hidden points of the cell.
◆ weighted_circumcenter()
template<typename Traits , typename Cb >
Returns the weighted circumcenter of the cell.
Be careful that the return type is Point_3
, and the radius of the weighted circumcenter is not supposed to be computed by the constructor Construct_weighted_circumcenter_3
of the traits class, hence the returned point has no weight.