Bowyer–Watson algorithm: Difference between revisions

Revision as of 02:03, 30 May 2007

Revision as of 02:04, 30 May 2007

Line 1:

{{sources|date=May 2007}}

{{context|date=May 2007}}

The '''The Bowyer-Watson algorithm '''computes the [[voronoiVoronoi diagram]] of a set of discreet points in any [[Number theory|number]] of [[dimensions]]. It is named after its [[Inventor|inventors]], [[Adrian Bowyer]] and [[David F. Watson]].

==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].

* 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 & Sons Ltd., Vol 2, Num 24, pp.167-172].

==See also==

Line 11 ⟶ 7:

* [[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].

* 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 & Sons Ltd., Vol 2, Num 24, pp.167-172].

{{math-stub}}

[[Category:Geometric algorithms]]