Delaunay triangulation: Difference between revisions

Content deleted Content added
Relocating/eliminating redundant second paragraph... see talk page for motivation for this change
Algorithms: Adding Bowyer-Watson
Line 103:
| url = http://www.springerlink.com/content/4gdja72vx1qmg44x/?p=a74909a339d9498cbff326f08b084b4c&pi=1
| doi = 10.1007/BF01975867}}</ref>), the runtime can be exponential in the dimension even if the final Delaunay triangulation is small.
 
The [[Bowyer-Watson_algorithm|Bowyer-Watson algorithm]] provides an another approach for incremental construction. It gives an alternative to edge flipping for computing the Delaunay triangles containing a newly inserted vertex.
 
===Divide and conquer===