CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Hi Adam,

if you redo the insert of the point, then it will return you the 
corresponding Vertex_handle (but it is not free).

If you know your point index in the vector, then you can use something
like this example:
https://doc.cgal.org/latest/Triangulation_3/Triangulation_3_2info_insert_with_zip_iterator_8cpp-example.html

(filling a vector id -> Vertex_handle from the info() field in vertices)

HTH,

Sebastien


On 6/8/22 8:31 PM, Adam Getchell ( via 
cgal-discuss Mailing List) wrote:
> If I construct a Delaunay_triangulation_3 from a vector of Points, e.g.
>
> std::vector<Point_t<3>> vertices{
> Point_t<3>{          0, 0, 0},
> Point_t<3>{ INV_SQRT_2, 0, INV_SQRT_2},
> Point_t<3>{          0, INV_SQRT_2, INV_SQRT_2},
> Point_t<3>{-INV_SQRT_2, 0, INV_SQRT_2},
> Point_t<3>{          0, -INV_SQRT_2, INV_SQRT_2},
> Point_t<3>{          0, 0, 2}
> };
> Delaunay_t<3> triangulation(vertices.begin(), vertices.end());
>
> (There are a bunch of aliases to resolve Points etc. to the correct 
> dimensionality based on the non-type template parameter.)
>
> How would I obtain a Vertex_handle to the Vertex in the Triangulation 
> containing Point(0,0,0)?
>
> Thanks for any insight.
> --
> Adam Getchell
> https://adamgetchell.org <https://adamgetchell.org>
>
>
>
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://sympa.inria.fr/sympa/info/cgal-discuss