CGAL 4.11.3 - Optimal Distances
|
Namespaces | |
cpp11 | |
IO | |
Scale_space_reconstruction_3 | |
Shape_detection_3 | |
Surface_mesh_parameterization | |
Functions | |
template<class RandomAccessIterator , class OutputIterator , class Traits > | |
OutputIterator | all_furthest_neighbors_2 (RandomAccessIterator points_begin, RandomAccessIterator points_end, OutputIterator o, Traits t=Default_traits) |
computes all furthest neighbors for the vertices of the convex polygon described by the range [points_begin , points_end ), writes their indices (relative to points_begin ) to o the furthest neighbor of points_begin[i] is points_begin[i-th number written to o] and returns the past-the-end iterator of this sequence. More... | |