The function natural_neighbor_coordinates_2 computes natural neighbor coordinates, also called Sibson's coordinates, for $$2D points provided a two-dimensional triangulation and a query point inside the convex hull of the vertices of the triangulation.
#include <CGAL/natural_neighbor_coordinates_2.h>
| ||||
| ||||
| ||||
computes the natural neighbor coordinates for p with respect to the points in the two-dimensional Delaunay triangulation dt. The template class Dt should be of type Delaunay_triangulation_2<Traits, Tds>. The value type of the OutputIterator is a pair of Dt::Point_2 and the coordinate value of type Dt::Geom_traits::FT. The sequence of point/coordinate pairs that is computed by the function is placed starting at out. The function returns a triple with an iterator that is placed past-the-end of the resulting sequence of point/coordinate pairs, the normalization factor of the coordinates and a boolean value which is set to true iff the coordinate computation was successful, i.e. if p lies inside the convex hull of the points in dt. | ||||
| ||||
| ||||
| ||||
The same as above. hole_begin and hole_end determines the iterator range over the boundary edges of the conflict zone of p in the triangulation. It is the result of the function T.get_boundary_of_conflicts(p,std::back_inserter(hole), start), see Delaunay_triangulation_2<Traits, Tds>. | ||||
| ||||
| ||||
| ||||
This function computes the natural neighbor coordinates of the point vh->point() with respect to the vertices of dt excluding vh->point(). The same as above for the remaining parameters. |