CGAL 2D Delaunay Triangulation: How to get all the edges
-
27-10-2019 - |
문제
How to get/iterate over all the edges in the 2D delaunay graph in CGAL (C++)?
For example, in MATLAB this is just edges(dt).
해결책
You simply need to use members functions
All_edges_iterator all_edges_begin()
All_edges_iterator all_edges_end()
to get the iterator range over edges.
It is documented on the Triangulation_2 page here
Note that you will get edges incident to the infinite vertex together with finite edges.
제휴하지 않습니다 StackOverflow