2 citations · 3 across the 5 of their papers we have counts for
7 papers
A Theory of L-shaped Floor-plans
Raveena, Krishnendra Shekhawat
Existing graph theoretic approaches are mainly restricted to floor-plans with rectangular boundary. In this paper, we introduce floor-plans with -shaped boundary (boundary with…
A Theory of Rectangularly Dualizable Graphs
Vinod Kumar, Krishnendra Shekhawat
A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all inte…
Rectangularly Dualizable Graphs: Area-Universality
Vinod Kumar, Krishnendra Shekhawat
A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all inte…
Transformations of Rectangular Dualizable Graphs
Vinod Kumar, Krishnendra Shekhawat
A plane graph is said to be a rectangular graph if each of its edges can be oriented horizontal or vertical, its internal regions are four-sided and it has a rectangular enclosure.…
GPLAN: Computer-Generated Dimensioned Floorplans for given Adjacencies
Krishnendra Shekhawat, Nitant Upasani, Sumit Bisht +1
In this paper, we present GPLAN, software aimed at constructing dimensioned floorplan layouts based on graph-theoretical and optimization techniques. GPLAN takes user requirements…
A linear time algorithm for constructing orthogonal floor plans with minimum number of bends
Pinki, Krishnendra Shekhawat
Let G = (V, E) be a planar triangulated graph (PTG) having every face triangular. A rectilinear dual or an orthogonal floor plan (OFP) of G is obtained by partitioning a rectangle…