| dc.contributor.author |
Shekhawat, Krishnendra |
|
| dc.date.accessioned |
2023-08-10T08:46:33Z |
|
| dc.date.available |
2023-08-10T08:46:33Z |
|
| dc.date.issued |
2023-01 |
|
| dc.identifier.uri |
https://www.sciencedirect.com/science/article/pii/S0304397522007010 |
|
| dc.identifier.uri |
http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11277 |
|
| dc.description.abstract |
Existing graph-theoretic approaches to construct floor-plans for a given plane graph are mainly restricted to floor-plans with rectangular boundary. This paper introduces floor-plans with L-shaped boundary (boundary with only one concave corner). To ensure the L-shaped boundary, we introduce the concept of non-triviality of a floor-plan. A floor-plan with a rectilinear boundary with at least one concave corner is non-trivial if the number of concave corners can not be reduced without affecting the modules' adjacencies. Further, we present necessary and sufficient conditions for the existence of a non-trivial L-shaped floor-plan corresponding to a properly triangulated plane graph (PTPG) G. Also, we develop an algorithm for its construction, if it exists. |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
Elsevier |
en_US |
| dc.subject |
Mathematics |
en_US |
| dc.subject |
Adjacency |
en_US |
| dc.subject |
Algorithm |
en_US |
| dc.subject |
Graph Theory |
en_US |
| dc.subject |
Concave corner |
en_US |
| dc.subject |
Non-rectangular floor-plan |
en_US |
| dc.title |
A theory of L-shaped floor-plans |
en_US |
| dc.type |
Article |
en_US |