Revision as of 16:31, 13 April 2010 edit Uzume (talk \| contribs) Extended confirmed users, Page movers, Template editors 12,664 edits m moved Bowyer-Watson algorithm to Bowyer–Watson algorithm ← Previous edit		Revision as of 02:30, 14 April 2010 edit undo Michael Hardy (talk \| contribs) Administrators 210,577 edits italicized the journal's title Next edit →
Line 1: In [[computational geometry]], the '''Bowyer–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 at the same time, and each published a paper on it in the same issue of ''[[The Computer Journal]]'' (see below). == See also ==

Bowyer–Watson algorithm: Difference between revisions