Constrained triangulations respect segment constraints. These constraints may intersect. CGAL's constrained triangulations come in two flavors, either simple constrained triangulations, or constrained Delaunay triangulations. In the latter case the triangles respect the Delaunay property.
| Functionality: | dynamic |
| Robustness: | industry strong |
| License: | QPL, commercial |
| Developed by: | INRIA |
|
|
|
| User Manual | Reference Manual | Demo |
