Skip to main content
Conference Proceedings

The power of non-rectilinear holes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1982) 140 LNCS 369-383
DOI: 10.1007/BFb0012784
84Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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

Cite

CITATION STYLE

APA

Lingas, A. (1982). The power of non-rectilinear holes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 140 LNCS, pp. 369–383). Springer Verlag. https://doi.org/10.1007/BFb0012784

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free