Enumerating floorplans with walls

Let P be a set of n points in the proper inside of an axis-aligned rectangle R, and each point in P has a type, which is h-type, v-type, or f-type. Those are shortened forms of horizontal type, vertical type, and free type. We wish to dissect R into a set S of n+1 rectangles by n horizontal or verti...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 342; pp. 1 - 11
Main Authors: Yamanaka, Katsuhisa, Nakano, Shin-ichi
Format: Journal Article
Language:English
Published: Elsevier B.V 15.01.2024
Subjects:
Algorithm
Enumeration
Enumeration algorithm
Feasible floorplan
Floorplan
Floorplan
Enumeration algorithm
Enumeration
Feasible floorplan
Algorithm
ISSN:0166-218X, 1872-6771
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Let P be a set of n points in the proper inside of an axis-aligned rectangle R, and each point in P has a type, which is h-type, v-type, or f-type. Those are shortened forms of horizontal type, vertical type, and free type. We wish to dissect R into a set S of n+1 rectangles by n horizontal or vertical line segments so that each point in P is on the common boundary line segment between two rectangles in S, and also each h-type point in P is on a horizontal line segment, each v-type point in P is on a vertical line segment, and each f-type point in P is on a horizontal or vertical line segment. Such a dissection of R is called a feasible floorplan of R with respect to P. Each point in P corresponds to the location of a structurally necessary horizontal or vertical wall, or a column (pillar) to support the upper part. In this paper, when P consists of points of the three described types, we present an efficient algorithm that enumerates all the feasible floorplans of R with respect to P. The algorithm is based on the reverse search method and enumerates all the feasible floorplans in O(n|SP|) time using O(n2) space, after O(nlogn) time preprocessing, where SP is the set of the feasible floorplans of R with respect to P. Moreover, we show that, after O(nlogn) time preprocessing, one can enumerate all feasible floorplans in SP in O(n) delay using O(n2) space.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2023.08.018