songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

add a line about being planar

This commit is contained in:
Jane Tournois 2025-06-23 16:51:23 +02:00
parent 2e26fdcc5f
commit d23fbd5b06
1 changed files with 1 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt
View File

@ -48,6 +48,7 @@ that satisfy the following properties:
one closed loop. one closed loop.
- Each polygonal face must be a simple polygon, i.e., its edges don't intersect, - Each polygonal face must be a simple polygon, i.e., its edges don't intersect,
except consecutive edges, which intersect at their common vertex. except consecutive edges, which intersect at their common vertex.
- Each polygonal face must be planar, meaning all its vertices lie on the same plane.
- Each polygonal face may have one or more holes, each of them also represented by an ordered list of vertices - Each polygonal face may have one or more holes, each of them also represented by an ordered list of vertices
from the PLC, forming a closed loop. from the PLC, forming a closed loop.
- If two polygons in the PLC intersect, their intersection is a union of edges and vertices from the - If two polygons in the PLC intersect, their intersection is a union of edges and vertices from the