Bowyer–Watson algorithm
In computational geometry, the Bowyer–Watson algorithm is a method for computing the Delaunay triangulation of a finite set of points in any number of dimensions. The algorithm can be also used to obtain a Voronoi diagram of the points, which is the dual graph of the Delaunay triangulation.
- Comment
- enIn computational geometry, the Bowyer–Watson algorithm is a method for computing the Delaunay triangulation of a finite set of points in any number of dimensions. The algorithm can be also used to obtain a Voronoi diagram of the points, which is the dual graph of the Delaunay triangulation.
- Depiction
- Has abstract
- enIn computational geometry, the Bowyer–Watson algorithm is a method for computing the Delaunay triangulation of a finite set of points in any number of dimensions. The algorithm can be also used to obtain a Voronoi diagram of the points, which is the dual graph of the Delaunay triangulation.
- Hypernym
- Method
- Is primary topic of
- Bowyer–Watson algorithm
- Label
- enBowyer–Watson algorithm
- Link from a Wikipage to an external page
- github.com/Bl4ckb0ne/delaunay-triangulation
- paulbourke.net/papers/triangulate/
- github.com/jmespadero/pyDelaunay2D
- Link from a Wikipage to another Wikipage
- Adrian Bowyer
- C++ (programming language)
- Category:Geometric algorithms
- Category:Triangulation (geometry)
- Computational geometry
- Delaunay triangulation
- Dimension
- Dual graph
- Hilbert curve
- Incremental computing
- Pseudocode
- Python (programming language)
- Star-shaped polygon
- The Computer Journal
- Voronoi diagram
- SameAs
- 4apxd
- Algorithme de Bowyer-Watson
- Algoritmo de Bowyer-Watson
- m.02rd9fq
- Q4951461
- Алгоритм Боуэра — Ватсона
- Subject
- Category:Geometric algorithms
- Category:Triangulation (geometry)
- Thumbnail
- WasDerivedFrom
- Bowyer–Watson algorithm?oldid=1118288465&ns=0
- WikiPageLength
- 5408
- Wikipage page ID
- 11454768
- Wikipage revision ID
- 1118288465
- WikiPageUsesTemplate
- Template:Cite journal
- Template:Reflist