Bowyer–Watson algorithm: Difference between revisions

Revision as of 02:04, 30 May 2007

Revision as of 03:22, 30 May 2007

Line 1:

{{sources|date=May 2007}}

{{context|date=May 2007}}

The '''Bowyer-WatsonBowyer–Watson algorithm ''' computes the [[Voronoi diagram]] of a finite set of discreet points in any number of [[dimensionsdimension]]s. It is named after its [[Inventor|inventors]], [[Adrian Bowyer]] and [[David F. Watson]].

==See also==

* [[Algorithm]]

* [[Set theory]]

* [[Venn diagram]]

==References==

* Adrian Bowyer (1981). ''Computing Dirichlet tessellations'', [http://comjnl.oxfordjournals.org/cgi/content/abstract/24/2/162 ''The Computer Journal'', 1981 '''24'''(2):162–166. {{doi|10.1093/comjnl/24.2.162-166]}}.

* David F. Watson (1981). ''Computing the ''n''-dimensional tessellation with application to Voronoi polytopes'', [http://comjnl.oxfordjournals.org/cgi/content/abstract/24/2/16 ''The Computer Journal'', Heyden'''24'''(2):167–172. & Sons Ltd{{doi|10., Vol 2, Num 1093/comjnl/24, pp.2.167-172]}}.

{{mathmathapplied-stub}}

[[Category:Geometric algorithms]]