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

Bowyer–Watson algorithm

 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
The Bowyer-Watson algorithm is a computational geometry algorithm used to incrementally construct a Delaunay triangulation of a set of points in a two-dimensional space. A Delaunay triangulation maximizes the minimum angle of the triangles formed, avoiding skinny triangles and ensuring better numerical stability for applications such as mesh generation and interpolation.

 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