Skip to main content
SpringerLink
Log in

Optimal Polygon Cover Problems and Applications

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2000)

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

Included in the following conference series:

Abstract

Polygon cover problems arise in computational geometry and in a number of applied areas, such as material layout, layered manufacturing, radiation therapy and radiosurgery, etc. In this paper, we study three optimal polygon cover problems: monotone polygon cover with obstacles, star-shaped polygon cover with obstacles, and rectangular cover. Based on useful geometric observations, we develop efficient algorithms for solving these problems.

Either our algorithms improve the quality of the previously best known solutions for these polygon cover problems, or our complexity bounds are comparable to those of the previously best known algorithms for simpler cases of the problems.

The first and the third author were supported in part by the National Science Foundation under Grants CCR-9623585 and CCR-9988468. The second author was supported in part by the National Science Foundation under Grants MIP-9701416 and CCR-9988468, and by HP Labs, Bristol, England, under an external research program grant.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. N.M. Amato, M.T. Goodrich, and E.A. Ramos, Computing the Arrangement of Curve Segments: Divide-and-Conquer Algorithms via Sampling, Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 705–706.

    Google Scholar 

  2. E.M. Arkin, Y.-J. Chiang, M. Held, J.S.B. Mitchell, V. Sacristan, S.S. Skiena, and T.-C. Yang, On Minimum-Area Hulls, Algorithmica, 21(1998), 119–136.

    Article  MATH  MathSciNet  Google Scholar 

  3. T. Asano, L.J. Guibas, and T. Tokuyama, Walking in an Arrangement Topologically, Int. J. of Comput. Geom. & Appl., 4(2)(1994), 123–151.

    Article  MATH  MathSciNet  Google Scholar 

  4. J.S. Chang and C.K. Yap, A Polynomial Solution for the Potato-Peeling Problem, Discrete Comput. Geom., 1(1986), 155–182.

    Article  MATH  MathSciNet  Google Scholar 

  5. B. Chazelle, Triangulating a Simple Polygon in Linear Time, Discrete Comput. Geom., 6(1991), 485–524.

    Article  MATH  MathSciNet  Google Scholar 

  6. D.Z. Chen, O. Daescu, Y. Dai, N. Katoh, X. Wu, and J. Xu, Optimizing the Sum of Linear Fractional Functions and Applications, Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 707–716.

    Google Scholar 

  7. D.Z. Chen and J. Xu, Peeling an Arrangement Topologically, Proc. 4th CGC Workshop on Comput. Geom., 1999.

    Google Scholar 

  8. K.M. Daniels, The Restrict/Evaluate/Subdivide Paradigm for Translational Containment, Proc. 5th MSI Stony Brook Workshop on Comput. Geom., 1995.

    Google Scholar 

  9. K.M. Daniels, Z. Li, and V.J. Milenkovic, Multiple Containment Methods, Technical Report TR-12-94, Division of Applied Sciences, Harvard University.

    Google Scholar 

  10. D. Eppstein and J. Erickson, Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions, Discrete Comput. Geom., 22(1999), 569–592.

    Article  MATH  MathSciNet  Google Scholar 

  11. J.E. Falk and S.W. Palocsay, Optimizing the Sum of Linear Fractional Functions, Collection: Recent Advances in Global Optimization, C.A. Floudas and P.M. Pardalos (eds.), 1992, 221–258.

    Google Scholar 

  12. R. Fleischer, K. Mehlhorn, G. Rote, E. Welzl, and C.K. Yap, Simultaneous Inner and Outer Approximation of Shapes, Algorithmica, 8(1992), 365–389.

    Article  MATH  MathSciNet  Google Scholar 

  13. S.K. Ghosh and D.M. Mount, An Output-Sensitive Algorithm for Computing Visibility Graphs, SIAM J. Comput., 20(1991), 888–910.

    Article  MATH  MathSciNet  Google Scholar 

  14. M.T. Goodrich, Geometric Data Structures, Handbook of Computational Geometry, J.-R. Sack and J. Urrutia (editors), Elsevier Science Publishers B.V., North-Holland, Amsterdam, 1998.

    Google Scholar 

  15. L.J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R.E. Tarjan, Linear-Time Algorithms for Visibility and Shortest Path Problems inside Triangulated Simple Polygons, Algorithmica, 2(1987), 209–233.

    Article  MATH  MathSciNet  Google Scholar 

  16. J. Hershberger and J. Snoeyink, Computing Minimum Length Paths of a Given Homotopy Class, Comput. Geom. Theory Appl., 9(1994), 63–98.

    MathSciNet  Google Scholar 

  17. D.T. Lee and F.P. Preparata, Euclidean Shortest Paths in the Presence of Rectilinear Barriers, Networks, 14(1984), 393–410.

    Article  MATH  MathSciNet  Google Scholar 

  18. J. Majhi, R. Janardan, M. Smid, and P. Gupta, On Some Geometric Optimization Problems in Layered Manufacturing, Comput. Geom.: Theory Appl., 12(1999), 219–239.

    MATH  MathSciNet  Google Scholar 

  19. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, Berlin, 1985.

    Google Scholar 

  20. A. Schweikard, R. Tombropoulos, and J.R. Adler, Robotic Radiosurgery with Beams of Adaptable Shapes, Proc. 1st Int. Conf. on Computer Vision, Virtual Reality and Robotics in Medicine, Lecture Notes in Computer Science, Vol. 905, Springer, 1995, pp. 138–149.

    Google Scholar 

  21. R. Tombropoulos, J.R. Adler, and J.C. Latombe, CARABEAMER: A Treatment Planner for a Robotic Radiosurgical System with General Kinematics, Medical Image Analysis, Medical Image Analysis, 3(1999), 1–28.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Notre Dame, 46556, Notre Dame, IN, USA

    Danny Z. Chen, Xiaobo Hu & Xiaodong Wu

Authors
  1. Danny Z. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaobo Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaodong Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Karlsruhe University, Germany

    Gerhard Goos

  2. Cornell University, NY, USA

    Juris Hartmanis

  3. Utrecht University, The Netherlands

    Jan van Leeuwen

  4. Academia Sinica, Institute of Information Science, 128 Academia Road, Section 2, Nankang, 115, Taipei, Taiwan, R.O.C.

    D. T. Lee

  5. Department of Computer Science and Akamai Technologies, University of Illinois at Urbana Champaign, 500 Technology Square, 02139, Cambridge, MA, USA

    Shang-Hua Teng

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, D.Z., Hu, X., Wu, X. (2000). Optimal Polygon Cover Problems and Applications. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, SH. (eds) Algorithms and Computation. ISAAC 2000. Lecture Notes in Computer Science, vol 1969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40996-3_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-40996-3_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41255-7

  • Online ISBN: 978-3-540-40996-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation