Franz Aurenhammer
Otfried Schwarzkopf
- AESW.P.K. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl. Euclidean minimum spanning trees and bichromafic closest pairs. Proc. 6th Ann. ACM Symp. Computational Geometry (1990), 203 - 210. Google Scholar
Digital Library
- AGSS.A. Aggarwal, LJ. Guibas, J. Saxe, P.W. Shot. A linear time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geometry 4 (1989), 591 - 604.Google ScholarDigital Library
- A1.F. Aurenhammer. A new duality result concerning Voronoi diagrams. Discrete Comput. Geometry 5 (1990), 243 - 254.Google ScholarDigital Library
- A2.F. Aurenhammer. Power diagrams: properties, algorithms, and applications. SIAM J. Computing 16 (1987), 78 - 96. Google ScholarDigital Library
- AS.F. Aurenhammer, O. SchwarzkopL A Simple Online Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams. To appear as a Technical Report, Freie Universit~t Berlin, 1991.Google Scholar
- BDSTY.J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, M. Yvinec. Applications of random sampling to online algorithms in computational geometry. Technical report, INRIA, 1990.Google Scholar
- BDT.J.-D. Boissonnat, O. Devillers, M. Teillaud. A randomized incremental algorithm for constructing higher order Voronoi diagrams. Algorithmica, to be published.Google Scholar
- CEGSS.B. ChazeUe, H. Edelsbrunner, L.J. Guibas, M. Shark, J. Snoeyink. Computing a face in an arrangement of line segments. 2na Ann. ACM-SIAM Symp. SODA, 1991, to be presented. Google ScholarDigital Library
- C.K.L. Clarkson. New applications ofrandom sampling in computational geometry. Discrete Comput. Geometry 2 (1987), 195 - 222.Google ScholarDigital Library
- CS.K.L. Clarkson, P.W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geometry 4 (1989), 387 - 421.Google ScholarDigital Library
- DSST.J.R. Driscoll, N. Samak, D.D. Sleator, R.E. Tarjan. Making data structures persistent. J. Comput. System Sci. 38 (1989), 86 - 124. Google ScholarDigital Library
- E.H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer, Berlin - Heidelberg, 1987. Google ScholarDigital Library
- GKS.L.J. Guibas, D.E. Knuth, M. Shark. Randomized incremental construction of Delaunay and Voronoi diagrams. Springer LNCS 443 (1990), 414- 431. Google ScholarDigital Library
- L.D.T. Lee. On k-nearest neighbor Voronoi diagrams in the plane. IEEE Trans. Computers C-31 (1982), 478 - 487.Google ScholarDigital Library
- MMO.K. Mehlhom, S. Meiser, C. O'Ddnlaing. On the constmction of abstract Voronoi diagrams. Discrete Cornput. Geometry, to be published.Google Scholar
- M.K. Mulmuley. On levels in arrangements and Voronoi diagrams. Discrete Comput. Geometry, to be published.Google Scholar
- Sc.O. Schwarzkopf. Randomized Incremental Algorithms in a Dynamic Setting. To appear as a Technical Report, Freie Universitiit Berlin, 1991.Google Scholar
- S1.R. Seidel. Linear programming and convex hulls made easy. Proc. 6th Ann. ACM Symp. Computational Geometry (1990), 211-215. Google ScholarDigital Library
- S2.R. Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Technical Report B 90--07, Freie UniversiCit Berlin, October 1990.Google Scholar
- W.E. Welzl. Constructing smallest enclosing disks (balls and ellipsoids). To appear as a Technical Report, Freie Universitlit Berlin, 1991.Google Scholar
Index Terms
- A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
Recommendations
Constructing levels in arrangements and higher order Voronoi diagrams
SCG '94: Proceedings of the tenth annual symposium on Computational geometryWe give a simple lazy randomized incremental algorithm to compute ≤k-levels in arrangements of x-monotone Jordan curves in the plane, and in arrangements of planes in three-dimensional space. If each pair of curves intersects in at most s points, the ...
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams
Given a set of n sites in the plane, the order-k Voronoi diagram is a planar subdivision such that all points in a region share the same k nearest sites. The order-k Voronoi diagram arises for the k-nearest-neighbor problem, and there has been a lot of ...
Incremental Voronoi Diagrams
We study the amortized number of combinatorial changes (edge insertions and removals) needed to update the graph structure of the Voronoi diagram (and several variants thereof) of a set S of n sites in the plane as sites are added to the set. To that ...
Comments