53 citations · 56 across the 10 of their papers we have counts for
11 papers
DPLAN: Minimal Connectivity to Floorplan Generation
Rohit Lohani, Krishnendra Shekhawat
Automated floor plan generation is an important problem in computational architectural design. The goal is to construct a floor plan from user-defined room numbers and door require…
Area-universality in Outerplanar Graphs
Ravi Suthar, Raveena, Krishnendra Shekhawat
A rectangular floorplan is a partition of a rectangle into smaller rectangles such that no four rectangles meet at a single point. Rectangular floorplans arise naturally in a varie…
Algorithmic Design and Graph-Based Classification for Rectilinear-Shaped Modules in Floor Plans
Rohit Lohani, Ravi Suthar, Krishnendra Shekhawat
We present a graph-theoretic framework for constructing floor plans that support non-rectangular modules, with particular emphasis on L-shaped and T-shaped geometries. Unlike tradi…
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…
Automated Generation of Dimensioned Rectangular Floorplans
Nitant Upasani, Krishnendra Shekhawat, Garv Sachdeva
This paper proposes a methodology for the automated construction of rectangular floorplans (RFPs) while addressing dimensional constraints and adjacency relations. Here, adjacency…
Connectivity Algorithm
Krishnendra Shekhawat
In this work, for the given adjacency matrix of a graph, we present an algorithm which checks the connectivity of a graph and computes all of its connected components. Also, it is…