Jump to content

Bowyer–Watson algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jitse Niesen (talk | contribs) at 17:36, 24 January 2008 (revertbut leave reference - verbatim copy of the reference added; please respect the copyright of the author of the lecture notes or leave a note here if you are the author). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Bowyer–Watson algorithm (or Watson algorithm) computes the Voronoi diagram of a finite set of points in any number of dimensions. It is named after its inventors, Adrian Bowyer and David F. Watson.

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.