c++ - how can i do delaunay triangulation of simple polygon and find it's neighbors for any triangles in cgal -
how can using cgal, delaunay triangulation of polygon (simple without hole , in cw order) , list of neighbors of triangles triangle generated delaunay triangulation?
look @ example in user manual: http://doc.cgal.org/latest/triangulation_2/index.html#title29
you must distinguish between faces in , outside of polygon.
when have face handle can 3 neighbor faces function neighbor(i) = 0, 1, , 2
see: http://doc.cgal.org/latest/tds_2/classtriangulationdsfacebase__2.html
Comments
Post a Comment