Skip to main content
SpringerLink
Log in

PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets

  • Conference paper
  • First Online:
Book cover Algorithm Engineering and Experimentation (ALENEX 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2153))

Included in the following conference series:

Abstract

Voronoi diagrams of pockets, i.e. polygons with holes, have a variety of important applications but are particularly challenging to compute robustly. We report on an implementation of a simple algorithm which does not rely on exact arithmetic to achieve robustness; rather, it achieves its robustness through carefully engineered handling of geometric predicates. Although we do not give theoretical guarantees for robustness or accuracy, the software has sustained extensive experimentation (on real and simulated data) and day-to-day usage on real-world data. The algorithm is shown experimentally to compare favorably in running time with prior methods.

See http://www.ams.sunysb.edu/~saurabh/pvd for latest on pvd.

Supported in part by grants from Bridgeport Machines and the National Science Foundation.

Partially supported by grants from Bridgeport Machines, the National Science Foundation (CCR-9732220) and Sun Microsystems.

Partially supported by grants from Bridgeport Machines, HRL Laboratories, NASA Ames, the National Science Foundation (CCR-9732220), Northrop-Grumman Corporation, Sandia National Labs, and Sun Microsystems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Auer and M. Held. Heuristics for the generation of random polygons. In Proc. 8th Canad. Conf. Comput. Geom., pages 38–43, 1996.

    Google Scholar 

  2. C. Burnikel, K. Mehlhorn, and S. Schirra. How to compute the Voronoi diagram of line segments: Theoretical and experimental results. In Proc. 2nd Annu. European Sympos. Algorithms, vol. 855 of LNCS, pages 227–239. Springer-Verlag, 1994.

    Google Scholar 

  3. F. Chin, J. Snoeyink, and C.-A. Wang. Finding the medial axis of a simple polygon in linear time. In Proc. 6th Annu. Internat. Sympos. Algorithms Comput., vol. 1004 of LNCS, pages 382–391. Springer-Verlag, 1995.

    Google Scholar 

  4. R. L. Drysdale, III. Generalized Voronoi Diagrams and Geometric Searching. Ph.D. thesis, Dept. Se, Stanford Univ., CA, USA, 1979. Report STAN-CS-79-705.

    Google Scholar 

  5. M. Held. http://www.cosy.sbg.ac.at/~held/ project/vroni/vroni.html

  6. M. Held. VRONI: An Engineering Approach to the Reliable and Efficient Computation f Voronoi Diagrams of Points and Line Segments. To appear in Computational Geometry: Theory and Applications.

    Google Scholar 

  7. M. Held. On the Computational Geometry of Pocket Machining, vol. 500 of LNCS Springer-Verlag, June 1991.

    MATH  Google Scholar 

  8. M. Held. Voronoi diagrams and offset curves of curvilinear polygons. Comput. Aided Design, 30(4):287–300, Apr. 1998.

    Google Scholar 

  9. M. Held. Computing Voronoi diagrams of line segments reliably and effciently. In Proc. 12th Canad. Conf. on Comput. Geom., pages 115–118, Fredericton, NB, Canada, 2000.

    Google Scholar 

  10. K. E. H. III, T. Culver, J. Keyser, M. Lin, and D. Manocha. Fast computation of generalized Voronoi diagrams using graphics hardware. In Proc. SIGGRAPH’99, In Comput. Graph., pages 277–285. ACM SIGGRAPH, Addison-Wesley, 1999.

    Google Scholar 

  11. T. Imai. A topology oriented algorithm for the Voronoi diagram of polygons. In Proc. 8th Canad. Conf. Comput. Geom., pages 107–112. Carleton University Press, Ottawa, Canada, 1996.

    Google Scholar 

  12. R. Klein. Concrete and Abstract Voronoi Diagrams, vol. 400 of LNCS Springer-Verlag, 1989.

    MATH  Google Scholar 

  13. D. T. Lee. Medial axis transformation of a planar shape. IEEE Trans. Pattern Anal. Mach. Intell., PAMI-4(4):363–369, 1982.

    Article  Google Scholar 

  14. D. T. Lee and R. L. Drysdale, III. Generalization of Voronoi diagrams in the plane. SIAM J. Comput., 10:73–87, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  15. G. Liotta, F. P. Preparata, and R. Tamassia. Robust proximity queries: An illustration of degree-driven algorithm design. SIAM J. Comput., 28(3):864–889, 1998.

    Article  MathSciNet  Google Scholar 

  16. K. Mehlhorn and S. Näher. LEDA, a library of efficient data types and algorithms. Report A 04/89, Univ. Saarlandes, Saarbrücken, Germany, 1989.

    Google Scholar 

  17. A. Okabe, B. Boots, and K. Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester, UK, 1992.

    MATH  Google Scholar 

  18. H. Persson. NC machining of arbitrarily shaped pockets. Comput. Aided Design, 10(3):169–174, May 1978.

    Google Scholar 

  19. F. P. Preparata. The medial axis of a simple polygon. In Proc. 6th Internat. Sympos. Math. Found. Comput. Sci., vol. 53 of LNCS, pages 443–450. Springer-Verlag, 1977.

    Google Scholar 

  20. S. Sethia. PhD thesis, SUNY at Stony Brook, NY 11794, USA., May 2001.

    Google Scholar 

  21. 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.

    Google Scholar 

  22. G. M. Voronoi. Nouvelles applications des paramètres continus à la théorie des formes quadratiques. deuxième Mémoire: Recherches sur les parallélloèdres primitifs. J. Reine Angew. Math., 134:198–287, 1908.

    MATH  Google Scholar 

  23. 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.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State University of New York at Stony Brook, NY, 11794, USA

    Saurabh Sethia, Martin Held & Joseph S. B. Mitchell

Authors
  1. Saurabh Sethia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Held
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joseph S. B. Mitchell
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. AT&T Labs Research, 180 Park Ave., P.O. Box 971, Florham Park, NJ, 07932-0000, USA

    Adam L. Buchsbaum

  2. Department of Computer Science, The University of North Carolina at Chapel Hill, CB 3175, Sitterson Hall, Chapel Hill, NC, 27599-3175, USA

    Jack Snoeyink

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sethia, S., Held, M., Mitchell, J.S.B. (2001). PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets. In: Buchsbaum, A.L., Snoeyink, J. (eds) Algorithm Engineering and Experimentation. ALENEX 2001. Lecture Notes in Computer Science, vol 2153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44808-X_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-44808-X_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42560-1

  • Online ISBN: 978-3-540-44808-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation