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

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!