Content deleted Content added
sectionize |
m Improve sections. |
||
Line 46:
</syntaxhighlight>
==
* [https://github.com/jmespadero/pyDelaunay2D pyDelaunay2D] : A didactic [[Python (programming language)|Python]] implementation of Bowyer–Watson algorithm.▼
* [https://github.com/Bl4ckb0ne/delaunay-triangulation Bl4ckb0ne/delaunay-triangulation] : [[C++ (programming language)|C++]] implementation of Bowyer–Watson algorithm.▼
{{reflist}}
== Further reading ==
*{{Cite journal | last1 = Bowyer | first1 = Adrian |author1-link=Adrian Bowyer| title = Computing Dirichlet tessellations | doi = 10.1093/comjnl/24.2.162 | journal = [[The Computer Journal|Comput. J.]] | volume = 24 | issue = 2 | pages = 162–166 | year = 1981 | pmid = | pmc = }}
*{{Cite journal | last1 = Watson | first1 = David F. | authorlink1 = | title = Computing the ''n''-dimensional Delaunay tessellation with application to Voronoi polytopes | doi = 10.1093/comjnl/24.2.167 | journal = [[The Computer Journal|Comput. J.]] | volume = 24 | issue = 2 | pages = 167–172 | year = 1981 | pmid = | pmc = }}
* [http://paulbourke.net/papers/triangulate/ Efficient Triangulation Algorithm Suitable for Terrain Modelling] generic explanations with source code examples in several languages.
== External links ==
▲* [https://github.com/jmespadero/pyDelaunay2D pyDelaunay2D] : A didactic [[Python (programming language)|Python]] implementation of Bowyer–Watson algorithm.
▲* [https://github.com/Bl4ckb0ne/delaunay-triangulation Bl4ckb0ne/delaunay-triangulation] : [[C++ (programming language)|C++]] implementation of Bowyer–Watson algorithm.
{{DEFAULTSORT:Bowyer-Watson algorithm}}
| |||