Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes

In this paper, we propose an algorithm to compute the Delaunay triangulation of a set of n points in 3-dimensional space when the points lie in 2 planes. The algorithm is output-sensitive and optimal with respect to the input and the output sizes. Its time complexity is O(n log n+t), where t is the size of the output, and the extra storage is O(n).

[1]  Mariette Yvinec,et al.  Applications of random sampling to on-line algorithms in computational geometry , 1992, Discret. Comput. Geom..

[2]  Jirí Matousek,et al.  Linear optimization queries , 1992, SCG '92.

[3]  Raimund Seidel,et al.  Constructing higher-dimensional convex hulls at logarithmic cost per face , 1986, STOC '86.

[4]  D. Pedoe,et al.  Geometry, a comprehensive course , 1988 .

[5]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[6]  John G. Ratcliffe,et al.  Geometry of Discrete Groups , 2019, Foundations of Hyperbolic Manifolds.

[7]  W. Abikoff,et al.  THE GEOMETRY OF DISCRETE GROUPS (Graduate Texts in Mathematics) , 1984 .

[8]  Jean-Daniel Boissonnat,et al.  Output-sensitive construction of the $3$-d Delaunay triangulation of constrained sets of points , 1991 .

[9]  Franz Aurenhammer,et al.  Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..

[10]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[11]  Leonidas J. Guibas,et al.  Computing convolutions by reciprocal search , 1986, SCG '86.

[12]  P. Mani,et al.  Shellable Decompositions of Cells and Spheres. , 1971 .

[13]  M. Teillaud,et al.  The space of spheres, a geometric tool to unify duality results on Voronoi diagrams , 1992 .

[14]  Leonidas J. Guibas,et al.  Topologically sweeping an arrangement , 1986, STOC '86.

[15]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[16]  Jean-Daniel Boissonnat,et al.  Shape reconstruction from planar cross sections , 1988, Comput. Vis. Graph. Image Process..