Construction of floorplans for plane graphs over polygonal boundaries

Rohit Lohani () and Krishnendra Shekhawat
Additional contact information
Rohit Lohani: Department of Mathematics, BITS Pilani
Krishnendra Shekhawat: Department of Mathematics, BITS Pilani

Journal of Combinatorial Optimization, 2024, vol. 48, issue 3, No 7, 25 pages

Abstract: Abstract A floorplan (F) is a partition of a polygonal boundary (P) into n-regions satisfying the adjacencies given by an n-vertex graph. Here, it is assumed that the sides of the polygonal boundary are either parallel to the x-axis or y-axis or have slopes $$-1$$ - 1 or 1. For a given polygonal boundary P (having m line segments) and a plane triangulated graph G, this paper presents a linear-time algorithm for constructing a floorplan with the required polygonal boundary satisfying all given adjacencies. Further, it has been proved that the number of sides of each region in the obtained floorplan (F) is at most m + 1 (except one region, which can have at most m + 5 sides) for the given polygonal boundary P of length m.

Keywords: Floorplan; Adjacency; Plane triangulated graph; Algorithm; Canonical labeling (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-024-01217-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:48:y:2024:i:3:d:10.1007_s10878-024-01217-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-024-01217-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().