Conference Proceedings

Partitioning rectilinear figures into rectangles

Proceedings of the 1988 ACM 16th Annual Conference on Computer Science, CSC 1988 (1988) 102-106
DOI: 10.1145/322609.322622
4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper discusses the problem of partitioning rectilinear regions, with or without holes, into a minimum number of rectangles. An algorithm which solves this partitioning problem in time O(n5/2), where n is the number of vertices of the rectilinear figure, is presented.

Cite

CITATION STYLE

APA

Chadha, R., & Allison, D. (1988). Partitioning rectilinear figures into rectangles. In Proceedings of the 1988 ACM 16th Annual Conference on Computer Science, CSC 1988 (pp. 102–106). Association for Computing Machinery, Inc. https://doi.org/10.1145/322609.322622

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