Bowyer–Watson algorithm: Difference between revisions

Revision as of 02:20, 27 January 2008

Revision as of 23:41, 9 February 2008

Line 1:

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 [[dimension]]s. 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.

The algorithm is sometimes known just as '''the Bowyer Algorithm''' or '''the Watson Algorithm'''. [[Adrian Bowyer]] and David Watson devised it independently of each other and at the same time, and each published a paper on it in the same issue of [[The Computer Journal]] (see below).

== See also ==