Revision as of 17:36, 24 January 2008 edit Jitse Niesen (talk \| contribs) Extended confirmed users 17,194 edits 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 ← Previous edit		Revision as of 02:20, 27 January 2008 edit undo RuppertsAlgorithm (talk \| contribs) 115 edits No edit summary Next edit →
Line 1: ~~The~~In [[computational geometry]], the '''Bowyer–Watson algorithm''' (or '''Watson algorithm''') ~~computes~~is a method for computing the [[Voronoi diagram]] of a finite set of points in any number of [[dimension]]s. ItThe algorithm is ~~named~~incremental: ~~after~~it ~~its~~works ~~inventors,~~by ~~[[Adrian~~adding ~~Bowyer]]~~points ~~and~~one ~~[[David~~at F.a ~~Watson]]~~time to a correct Voronoi diagram of a subset of the desired points. ▼ ~~{{context\|date=May 2007}}~~ ▲The '''Bowyer–Watson algorithm''' (or '''Watson algorithm''') computes the [[Voronoi diagram]] of a finite set of points in any number of [[dimension]]s. It is named after its inventors, [[Adrian Bowyer]] and [[David F. Watson]]. == See also == * [[Fortune's algorithm]] * [[Delaunay triangulation]] * [[Computational geometry]] ==References==

Bowyer–Watson algorithm: Difference between revisions