Jump to content

Bowyer–Watson algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by RuppertsAlgorithm (talk | contribs) at 02:20, 27 January 2008. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computational geometry, the Bowyer–Watson algorithm (or Watson algorithm) is a method for computing the Voronoi diagram of a finite set of points in any number of dimensions. The algorithm is incremental: it works by adding points one at a time to a correct Voronoi diagram of a subset of the desired points.

See also


References

  • Adrian Bowyer (1981). Computing Dirichlet tessellations, The Computer Journal, 24(2):162–166. doi:10.1093/comjnl/24.2.162.
  • David F. Watson (1981). Computing the n-dimensional tessellation with application to Voronoi polytopes, The Computer Journal, 24(2):167–172. doi:10.1093/comjnl/24.2.167.
  • Henrik Zimmer, Voronoi and Delaunay Techniques, lecture notes, Computer Sciences VIII, RWTH Aachen, 30 July 2005.


Stub icon

This applied mathematics–related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Bowyer–Watson_algorithm&oldid=187157566"