constrained delaunay triangulation
/K AH0 N S T R EY1 N D EH0 L AO0 N EY0 T R AY0 AE0 NG G Y UW0 L EY0 SH AH0 N/N
- 1
In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required segments into the triangulation as edges, unlike the Delaunay triangulation itself which is based purely on the position of a given set of vertices without regard to how they should be connected by edges.
Translate “constrained delaunay triangulation” into another language
Choose a language below to open the translator with English selected as the source language.