Definitions from Wikipedia (Constrained Delaunay triangulation)

▸ noun:  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.


▸ Words similar to constrained delaunay triangulation
▸ Usage examples for constrained delaunay triangulation

▸ Idioms related to constrained delaunay triangulation
▸ Wikipedia articles (New!)
▸ Words that often appear near constrained delaunay triangulation
▸ Rhymes of constrained delaunay triangulation

▸ Invented words related to constrained delaunay triangulation