Skip to main content
SpringerLink
Log in

Minimum convex partition of a polygon with holes by cuts in given directions

  • Session 8a: Invited Presentation
  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1996)

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

Included in the following conference series:

Abstract

Let F be a given family of directions in the plane. The problem to partition a planar polygon P with holes into a minimum number of convex polygons by cuts in the directions of F is proved to be NP-hard if ¦F¦ ≥ 3 and it is shown to admit a polynomial-time algorithm if ¦F¦ ≤ 2.

The second author was supported by TFR during his visit to Lund University.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Asano, M. Sato, T. Ohtsuki, Computational geometry algorithms, in Layout Design and Verification, T. Ohtsuki, ed., North-Holland, Amsterdam, 1986, pp. 295–347.

    Google Scholar 

  2. M. Bern, D. Epstein, Mesh generation and optimal triangulation, in Computing in Euclidean Geometry, 2nd ed., D.-Z. Du, F.K. Hwang, eds., World Scientific, Singapore, 1995, pp. 47–123.

    Google Scholar 

  3. B. Chazelle, D. P. Dobkin, Optimal convex decomposition, in Computational Geometry, G.T. Toussaint, ed., North-Holland, Amsterdam, 1985, pp. 63–133.

    Google Scholar 

  4. B. Chazelle, L. Palios, Decomposition algorithms in geometry, in Algebraic Geometry and Applications, C.L. Bajaj, ed., Springer, New York, 1994, pp. 419–449.

    Google Scholar 

  5. V. J. Dielissen V.J.A. Kaldewaij, Rectangular partition is polynomial in two dimensions but NP-complete in three, Inform. Process. Lett. 38 (1991), pp. 1–6.

    Article  Google Scholar 

  6. A. Gorpinevich, V. Soltan, Algorithms for the partition of a polygonal region into trapezoids and convex strips in problems of LSI design, (Russian) Voprosy Kibernet. (Moscow) No. 156 (1991), pp. 45–56.

    Google Scholar 

  7. D. H. Greene, The decomposition of polygons into convex parts, in Advances in Computing Research, F.P. Preparata, ed., JAI Press, London, 1983, pp. 235–259.

    Google Scholar 

  8. F. Harary, Graph Theory, Addison-Wesley Publ., Massachusetts, 1969.

    Google Scholar 

  9. H. Imai, T. Asano, Efficient algorithm for geometric graph search problems, SIAM J. Comput. 15 (1986), pp. 478–494.

    Article  Google Scholar 

  10. J. M. Keil, Decomposing a polygon into simpler components, SIAM J. Comput. 14 (1985), pp. 799–817.

    Article  Google Scholar 

  11. J. M. Keil, J.-R. Sack, Minimum decomposition of polygonal objects, in Computational Geometry, G.T. Toussaint, ed., North Holland, Amsterdam, 1985, pp. 197–216.

    Google Scholar 

  12. N. M. Korneenko, G. V. Matveev, N. N. Metel'ski, R. I. Tyškevič, Partitions of polygons, (Russian) Vesci Akad. Navuk BSSR. Ser. Fiz.-Mat. Navuk, 1978, no. 2, pp. 25–29.

    Google Scholar 

  13. D. T. Lee, F. P. Preparata, Computational geometry — a survey, IEEE Trans. Comput. C-33 (1984), pp. 1072–1101.

    Google Scholar 

  14. D. Lichtenstein, Planar formulas and their uses, SIAM J. Comput. 11 (1982), pp. 329–343.

    Google Scholar 

  15. A. Lingas, The power of non-rectilinear holes, Lecture Notes Comput. Sci. Vol. 140, 1982, pp. 369–383.

    Google Scholar 

  16. A. Lingas, V. Soltan, Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions, Technical Report, Lund University, 1996 (avaible at http://www.dna.lth.se/Research/Algorithms/Papers.description.html).

    Google Scholar 

  17. W. Lipski, Finding a Manhattan path and related problems, Networks 13 (1983), pp. 399–409.

    Google Scholar 

  18. W. Lipski, An O(n log n) Manhattan path algorithms, Inf. Process. Lett. 19 (1984), pp. 99–102.

    Article  Google Scholar 

  19. W. Newman, R. Sproull, Principles of Interactive Computer Graphics, 2nd ed., McGraw-Hill, New York, 1979.

    Google Scholar 

  20. J. O'Rourke, Art Gallery and Algorithms, Oxford Univ. Press, New York, 1987.

    Google Scholar 

  21. J. O'Rourke, K. Supowit, Some NP-hard polygon decomposition problems, IEEE Trans. Inform. Theory 29 (1983), pp. 181–190.

    Google Scholar 

  22. T. Pavlidis, Structural Pattern Recognition, Springer, Berlin, 1977.

    Google Scholar 

  23. Ch. Prisacaru, P. Soltan, On partition of a planar region into d-convex parts and its application, (Russian) Dokl. Akad Nauk SSSR 262 (1982), pp. 271–273. (English transl. Soviet Math. Dokl. 25 (1982), pp. 53–55.)

    Google Scholar 

  24. V. Soltan, Partition of a planar set into a finite number of d-convex parts, (Russian) Kibernetika (Kiev), 1984, no. 6, pp. 70–74. (English transl. Cybernetics 20 (1984), pp. 855–860.)

    Google Scholar 

  25. V. Soltan, A. Gorpinevich, Minimum dissection of rectilinear polygon with arbitrary holes into rectangles, Discrete Comput. Geom. 9 (1993), pp. 57–79.

    Article  Google Scholar 

  26. G. T. Toussaint, Computational geometric problems in pattern recognition, in Pattern Recognition. Theory and Applications, J. Kittler, ed., Reidel Publ. Co., Dordrecht, 1982, pp. 73–91.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Computer Science, Lund University, S-22100, Lund, Sweden

    A. Lingas

  2. Mathematical Institute, Academy of Sciences, MD-20028, Chişinău, Moldova

    V. Soltan

Authors
  1. A. Lingas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Soltan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Yoshihide Igarashi Hiroshi Nagamochi Satoru Miyano Subhash Suri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lingas, A., Soltan, V. (1996). Minimum convex partition of a polygon with holes by cuts in given directions. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009508

Download citation

  • DOI: https://doi.org/10.1007/BFb0009508

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62048-8

  • Online ISBN: 978-3-540-49633-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation