Bowyer–Watson algorithm: Difference between revisions

Revision as of 22:02, 22 July 2012

Revision as of 14:20, 20 April 2013

Line 3:

The Bowyer–Watson algorithm is an incremental algorithm. It works by adding points, one at a time, to a valid Delaunay triangulation of a subset of the desired points. After every insertion, any triangles whose circumcircles contain the new point are deleted, leaving a [[star-shaped polygon]]al hole which is then re-triangulated using the new point.

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

Line 14:

*{{cite doi|10.1093/comjnl/24.2.167}}

{{DEFAULTSORT:Bowyer-Watson algorithm}}

{{mathapplied-stub}}

[[Category:Geometric algorithms]]

{{mathapplied-stub}}