Enumerating Floorplans with Aligned Columns

A floorplan is a partition of an axis-aligned rectangle into a set of smaller rectangles. Given an axis-aligned rectangle R and a set P of points in R we wish to partition R into a set S of rectangles so that each point in P is on a boundary of a rectangle in S. We call such a partition of R a floor...

Full description

Saved in:
Bibliographic Details
Published inIEICE Transactions on Information and Systems Vol. E108.D; no. 3; pp. 181 - 185
Main Author NAKANO, Shin-ichi
Format Journal Article
LanguageEnglish
Published Tokyo The Institute of Electronics, Information and Communication Engineers 01.03.2025
Japan Science and Technology Agency
Subjects
algorithm
Algorithms
enumeration
floorplan
Floorplans
Online AccessGet full text
ISSN0916-8532
1745-1361
1745-1361
DOI10.1587/transinf.2024FCP0001

Cover

More Information
Summary:A floorplan is a partition of an axis-aligned rectangle into a set of smaller rectangles. Given an axis-aligned rectangle R and a set P of points in R we wish to partition R into a set S of rectangles so that each point in P is on a boundary of a rectangle in S. We call such a partition of R a floorplan covering P. Intuitively P is the locations of columns and a floorplan covering P is a floorplan in which no column is in the proper inside of a room and each column is on a wall. In this paper we design an algorithm to generate all floorplans covering P when P is the set of given grid points. The algorithm generates each floorplan in O(|P|) time.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0916-8532
1745-1361
1745-1361
DOI:10.1587/transinf.2024FCP0001