A Theory of L-shaped Floor-plans

05/28/2022
by   Raveena, et al.
0

Existing graph theoretic approaches are mainly restricted to floor-plans with rectangular boundary. In this paper, we introduce 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 within it. Further, we present necessary and sufficient conditions for the existence of a non-trivial L-shaped floor-plan corresponding to a properly triangulated planar graph (PTPG) G. Also, we develop an O(n^2) algorithm for its construction, if it exists.

READ FULL TEXT

page 1

page 7

research
06/25/2020

A linear time algorithm for constructing orthogonal floor plans with minimum number of bends

Let G = (V, E) be a planar triangulated graph (PTG) having every face tr...
research
04/22/2022

A note on graph drawings with star-shaped boundaries in the plane

In this note, we propose a straightforward method to produce an straight...
research
01/07/2022

InRS: implementing the indicator function of NURBS-shaped planar domains

We provide an algorithm that implements the indicator function of NURBS-...
research
08/30/2011

Proof System for Plan Verification under 0-Approximation Semantics

In this paper a proof system is developed for plan verification problems...
research
12/21/2020

New plans orthogonal through the block factor

In the present paper we construct plans orthogonal through the block fac...
research
01/23/2014

Algorithms and Limits for Compact Plan Representations

Compact representations of objects is a common concept in computer scien...
research
08/13/2018

Generating Paths with WFC

Motion plans are often randomly generated for minor game NPCs. Repetitiv...

Please sign up or login with your details

Forgot password? Click here to reset