CODEWITHSUNDEEP
c++cgal
egev
egev

Reputation: 51

Understand to which constrained edge a Steiner point belongs in constrained conforming triangulation CGAL

I followed the example reported here: https://doc.cgal.org/latest/Mesh_2/index.html (at paragraph "1.3 Example: Making a Triangulation Conforming Delaunay and Then Conforming Gabriel") to create a conforming constrained Delaunay triangulation using CGAL. Making the triangulation conforming may introduce in the triangulation itself some Steiner vertexes that are not present among the original input vertexes. Is it possible to know to which original constrained edge a Steiner vertex belongs? That is, when performing constrained triangulation, we can insert more than one CGAL::Polygon_2 into the triangulation as a constraint (it is done for example at this link from the CGAL manual: https://doc.cgal.org/latest/Triangulation_2/index.html); so, in other words, I would like to know if I can understand to which of the original constrained edges (or, if not possible, to which polygon) a specific Steiner vertex belongs to, is it possible? and how could I achieve this?

Upvotes: 1

Views: 206

Answers (1)

sloriot
sloriot

Reputation: 6293

If you use the Constrained_triangulation_plus_2 with your current triangulation as base triangulation, you will have a notion of subconstraints that will give you access to vertices in the middle of original constraints. However, if you have intersection between your input constraints, the intersection vertices will also be reported as inside a constraint.

In this example you have an example of iteration over input constraints and look at vertices on the constraints.

Upvotes: 0

Related Questions