论文信息 - On the Number of Delaunay Triangles occurring in all Contiguous Subsequences

On the Number of Delaunay Triangles occurring in all Contiguous Subsequences

Given an ordered sequence of points P = {p1, p2, . . . pn}, we are interested in the number of different Delaunay triangles occurring when considering the Delaunay triangulations of all contiguous subsequences within P . While clearly point sets and orderings with Θ(n2) Delaunay triangles exist, we prove that for an arbitrary point set in random order, the expected number of Delaunay triangles is Θ(n logn).

S. Funke | Felix Weitbrecht | S. Funke | Felix Weitbrecht

[1] David G. Kirkpatrick,et al. On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.

[2] D. Kirkpatrick,et al. A Framework for Computational Morphology , 1985 .

[3] David Eppstein,et al. The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction , 1998, Graph. Model. Image Process..

[4] Leonidas J. Guibas,et al. Randomized incremental construction of Delaunay and Voronoi diagrams , 1990, Algorithmica.