A compact piecewise-linear Voronoi diagram for convex sites in the plane

Discrete and Computational Geometry

Volumn 15, Issue 1, 1996, Pages 73-105

  McAllister, M ^a   Kirkpatrick, D ^a   Snoeyink, J ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030549637     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02716580     Document Type: Article

References (37)

1. H. Alt, D. Hsu, and J. Snoeyink. Computing the largest inscribed isothetic rectangle. Proc. 7th Canad. Conf. Comput. Geom., pp. 67-72, Université Laval, Quebec, 1995.
2. H. Alt and C. K. Yap. Algorithmic aspects of motion planning: a tutorial, part 2. Algorithms Rev., 1(2):61-77, 1990.
3. F. Aurenhammer. Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput. Surveys, 23(3):345-405, 1991.
4. M. Ben-Or. Lower bounds for algebraic computation trees. Proc. 15th Ann. ACM STOC, pp. 80-86, 1983.
5. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Discrete Comput. Geom., 8:51-71, 1992.
6. J.-D. Boissonnat, O. Devillers, and M. Teillaud. A dynamic construction of higher-order Voronoi diagrams and its randomized analysis. Technical Report 1207, INRIA Sophia-Antipolis, Valbonne, 1990.
7. J.-D. Boissonnat and M. Teillaud. A hierarchical representation of objects: the Delaunay tree. Proc. 2nd Ann. ACM Symp. Comput. Geom., pp. 260-268, 1986.
8. J.-D. Boissonnat and M. Teillaud. On the randomized construction of the Delaunay tree. Technical Report 1140, INRIA Sophia-Antipolis, Valbonne, 1989.
9. J. Canny and B. Donald. Simplified Voronoi diagrams. Discrete Comput. Geom., 3:219-236, 1988.
10. J. W. S. Cassels. An Introduction to the Geometry of Numbers. Springer-Verlag, Berlin, 1959.
11. L. P. Chew and R. L. Drysdale. Voronoi diagrams based on convex distance functions. Proc. ACM Symp. Comp. Geom., pp. 235-244, 1985.
12. M. de Berg, J. Matoušek, and O. Schwarzkopf. Piecewise linear paths among convex obstacles. Proc. 25th Ann. ACM STOC, pp. 505-514, 1993.
13. O. Devillers, S. Meiser, and M. Teillaud. Fully dynamic Delaunay triangulation in logarithmic expected time per operation. Comput. Geom. Theory Appl., 2(2):55-80, 1992.
14. H. Edelsbrunner. Computing the extreme distances between two convex polygons. J. Algorithms, 6:213-224, 1985.
15. H. Edelsbrunner, L. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision. SIAM J. Comput., 15:317-340, 1986.
16. S. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153-174, 1987.
17. L. J. Guibas, D. E. Knuth, and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica, 7:381-413, 1992.
18. T. C. Kao and D. M. Mount. An algorithm for computing compacted Voronoi diagrams defined by convex distance functions. Proc. 3rd Canad. Conf. Comput. Geom., pp. 104-109, Simon Fraser University, Vancouver, 1991.
19. D. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput., 12:28-35, 1983.
20. D. Kirkpatrick and J. Snoeyink. Computing constrained segments: butterfly wingspans in logarithmic time. Proc. 5th Canad. Conf. Comput. Geom., pp. 163-168, Waterloo, 1993.
21. D. Kirkpatrick and J. Snoeyink. Tentative prune-and-search for computing fixed-points with applications to geometric computation. Fund. Inform., pp. 353-370, 1994.
22. D. G. Kirkpatrick. Efficient computation of continuous skeletons. Proc. 18th FOCS, pp. 162-170, 1977.
23. R. Klein. Concrete and Abstract Voronoi Diagrams. LNCS, Vol. 400. Springer-Verlag, Berlin, 1989.
24. R. Klein, K. Mehlhorn, and S. Meiser. Randomized incremental construction of abstract Voronoi diagrams. Comput. Geom. Theory Appl., 3(3):157-184, 1993.
25. D. Leven and M. Sharir. Planning a purely translational motion for a convex polygonal object in two dimensional space using generalized Voronoi diagrams. Discrete Comput. Geom., 2:9-31, 1987.
26. K. Mehlhorn, S. Meiser, and C. Ó'Dúnlaing. On the construction of abstract Voronoi diagrams. Discrete Comput. Geom., 6:211-224, 1991.
27. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, NJ, 1993.
28. C. O'Dunlaing and C. K. Yap. A "retraction" method for planning the motion of a disc. J. Algorithms, 6:104-111, 1985.
29. F. P. Preparata and M. I. Shamos. Computational Geometry - An Introduction. Springer-Verlag, New York, 1985.
30. H. Rohnert. Moving a disc between polygons. Algorithmica, 6:182-191, 1991.
31. N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Comm. ACM, 29:669-679, 1986.
32. J. T. Schwartz, M. Sharir, and J. Hopcroft, editors. Planning, Geometry, and Complexity of Robot Motion. Ablex Series in Artificial Intelligence. Ablex, Norwood, NJ, 1987.
33. R. Seidel. Constrained Delaunay triangulations and Voronoi diagrams. In Report 260, pp. 178-191. IIG-TU, Graz, 1988.
34. M. I. Shamos and D. Hoey. Closest point problems. Proc. 16th FOCS, pp. 151-162, 1975.
35. S. Sifrony. A real nearly linear algorithm for translating a convex polygon. Technical Report 479, Courant Inst. Math. Sci., NYU, 1989.
36. K. Sugihara and M. Iri. Construction of the Voronoi diagram for "one million" generators in single-precision arithmetic. Proc. IEEE, 80(9): 1471-1484, Sept. 1992.
37. C. K. Yap. An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete Comput. Geom., 2:365-393, 1987.