Skip to main content
SpringerLink
Log in

The power of non-rectilinear holes

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1982)

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

Included in the following conference series:

Abstract

Four multiconnectcd-polygon partition problems are shown to be NP-hard.

This research was supported by NSF grants MCS-8006938 and MCS-7805849.

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. Chazelle,B., Computational Geometry and Convexity, PhD thesis, Yale University, 1980.

    Google Scholar 

  2. Chazelle,P, Convex Decompositions of Polyhedra, Proceedings of the 13th ACM SIGACT Symposium, Milwaukee, Wisconsin, May, 1981.

    Google Scholar 

  3. Chazelle, B. and D. Dobkin, Decomposing polygon into its convex parts, Proceedings of the 11th ACM SIGACT Symposium, New York, 1979.

    Google Scholar 

  4. Garey M.R., Johnson D.S., Preparata F.P., Tarjan R.E., Triangulating a simple polygon, Information Processing Letters, Vol. 7, No. 4, 1978.

    Article  MathSciNet  Google Scholar 

  5. Lichtenstein,D., Planar Formulae and their Uses, to appear.

    Google Scholar 

  6. Lingas A., R.Pinter, R.Rivest and A.Shamir, Minimum Edge Length Decompositions of Rectilinear Figures, unpublished manuscript, MIT, 1981.

    Google Scholar 

  7. Masek W., Some NP-complete set covering problems, unpublished manuscript, MIT, 1979.

    Google Scholar 

  8. O'Rourke J., K.Supowit, Some NP-hard polygon decomposition problems, submitted for publication.

    Google Scholar 

  9. Pagli,L., E.Lodi, F.Luccio, C.Mugnai and W.Lipski, On two dimensional data organization 2, Fundamenta Informaticae, Vol. 2, No.3, 1979.

    Google Scholar 

  10. Pinter R., private communication, 1981.

    Google Scholar 

  11. Shamos, I. and D. Hoey, Geometric intersection problems, Proceedings of the 17th IEEE FOCS Symposium, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Science, MIT, USA

    Andrzej Lingas

Authors
  1. Andrzej Lingas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lingas, A. (1982). The power of non-rectilinear holes. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012784

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11576-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation