Partitioning rectilinear figures into rectangles

Authors:
Ritu Chadha;Donald Allison
Affiliations:
Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA;Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA
Venue:
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Year:
1988

Citing 1
Cited 1

Minimally covering a horizontally convex orthogonal polygon

SCG '86 Proceedings of the second annual symposium on Computational geometry

Spatial indexing in agent-based crowd simulation

Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques

Quantified Score

Hi-index	0.00

Visualization

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.