Incremental topological flipping works for regular triangulations
- Cite this article as:
- Edelsbrunner, H. & Shah, N.R. Algorithmica (1996) 15: 223. doi:10.1007/BF01975867
- 260 Downloads
A set ofn weighted points in general position in ℝd defines a unique regular triangulation. This paper proves that if the points are added one by one, then flipping in a topological order will succeed in constructing this triangulation. If, in addition, the points are added in a random sequence and the history of the flips is used for locating the next point, then the algorithm takes expected time at mostO(nlogn+n[d/2]). Under the assumption that the points and weights are independently and identically distributed, the expected running time is between proportional to and a factor logn more than the expected size of the regular triangulation. The expectation is over choosing the points and over independent coin-flips performed by the algorithm.