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

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
Delaunay triangulation is a geometric method for dividing a set of points into triangles such that no point is inside the circumcircle of any triangle in the triangulation. This property maximizes the minimum angle of the triangles, which helps avoid skinny triangles and is particularly useful in computational geometry and various applications including computer graphics, geographical information systems (GIS), and numerical simulations.

 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