Voronoi diagrams for convex polygon-offset distance functions

Discrete and Computational Geometry

Volumn 25, Issue 2, 2001, Pages 271-291

  Barequet, G ^a   Dickerson, M T ^b   Goodrich, M T ^a  

^a Johns Hopkins University   (United States)

^b MIDDLEBURY COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035578883     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004540010081     Document Type: Article

References (18)

1. O. Aichholzer and F. Aurenhammer, Straight skeletons for general polygonal figures in the plane, Proc. 2nd COCOON, Lecture Notes in Computer Science, 1090, Springer-Verlag, Berlin, 1996, pp. 117-126.
2. O. Aichholzer, D. Alberts, F. Aurenhammer, and B. Gärtner, A novel type of skeleton for polygons, Journal of Universal Computer Science (an electronic journal), 1 (1995), 752-761.
3. G. Barequet, A. Briggs, M. Dickerson, and M. T. Goodrich, Offset-polygon annulus placement problems, Computational Geometry: Theory and Applications, 11 (1998), 125-141.
4. L. P. Chew and R. L. Drysdale, Voronoi Diagrams Based on Convex Distance Functions, Technical Report PCS-TR86-132, Dept. of Computer Science, Dartmouth College, Hanover, NH 03755, 1986; a preliminary version appeared in Proc. 1st Ann. ACM Symp. on Computational Geometry, Baltimore, MD, 1985, pp. 235-244.
5. C. M. Creveling, Tolerance Design: A Handbook for Developing Optimal Specifications, Addison-Wesley, Reading, MA, 1997.
6. J. Dugundji, Topology, Allyn and Bacon, Boston, MA, 1970.
7. S. Fortune, A sweepline algorithm for Voronoi diagrams, Algorithmica, 2 (1987), 153-174.
8. R. Klein, Concrete and Abstract Voronoi Diagrams, Lecture Notes in Computer Science, 400, Springer-Verlag, Berlin, 1989.
9. R. Klein, K. Mehlhorn, and S. Meiser, Randomized incremental construction of abstract Voronoi diagrams, Computational Geometry: Theory and Applications, 3 (1993), 157-184.
10. J. L. Kelley and I. Namioka, Linear Topological Spaces, Springer-Verlag, New York, 1976.
11. D. Kirkpatrick and J. Snoeyink, Tentative prune-and-search for computing fixed-points with applications to geometric computation, Fundamental Informaticœ, 22 (1995), 353-370.
12. R. Klein and D. Wood, Voronoi diagrams based on general metrics in the plane, Proc. 5th Symp. on Theoretical Aspects in Computer Science, Lecture Notes in Computer Science, 294, Springer-Verlag, Berlin, 1998, pp. 281-291.
13. M. McAllister, D. Kirkpatrick, and J. Snoeyink, A compact piecewise-linear Voronoi diagram for convex sites in the plane, Discrete & Computational Geometry, 15 (1996), 73-105.
14. K. Mehlhorn, S. Meiser, and Ó'Dúnlaing, On the construction of abstract Voronoi diagrams, Discrete & Computational Geometry, 6 (1991), 211-224.
15. K. Mehlhorn, S. Meiser, and R. Rasch, Furthest Site Abstract Voronoi Diagrams, Technical Report MPI-I-92-135, Max-Planck-Institut für Informatik, Saarbrücken, 1992.
16. A. Okabe, B. Boots, and K. Sugihara, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, Wiley, Chichester, 1992.
17. J. O'Rourke, Computational Geometry in C, Cambridge University Press, New York, 1994.
18. D. RAPPAPORT, Computing the furthest site Voronoi diagram for a set of disks, Proc. 1st Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, 382, Springer-Verlag, Berlin, pp. 57-66, 1989