OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Constrained Delaunay triangulation

 Home Mathematics Fields of mathematics Discrete mathematics Discrete geometry Triangulation (geometry)
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Constrained Delaunay triangulation (CDT) is a type of triangulation for a planar point set that respects certain constraints, particularly the inclusion of specified edges (or line segments) in the triangulation. This is an extension of the standard Delaunay triangulation, which is defined without any constraints.

 Ancestors (6)

  1. Triangulation (geometry)
  2. Discrete geometry
  3. Discrete mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook