A generic rectangular partition is a partition of a rectangle into a finite number of rectangles provided that no four of them meet at a point. A graph H is called dual of a plane graph G if there is one−to−one ...

This paper presents a systematic pathway for the floor plan design when given the shape of required floor plan, the list of spaces, the dimensions of each space and the weighted matrix of required adjacencies between the ...

To compare two architectural designs or to characterize them, some numbers are needed. These numbers are said to be covariants. In this paper, we present a software prototype that generates a floor plan design and its ...

This work consider the problem of rectilinear arrangement which is about arranging given rectangular objects of different sizes in the frame of a given rectilinear polygon while considering dimension and position of each ...

An important task in the initial stages of most architectural design processes is the design of planar floor plans, that are composed of non-overlapping rooms divided from each other by walls while satisfying given topological ...

In this paper, we present GPLAN, a software aimed at constructing dimensioned floorplan layouts using graph-theoretical and optimization techniques. For GPLAN, the adjacency requirements are given in the following two ...

This paper aims at automatically generating dimensioned floorplans while considering constraints given by the users in the form of adjacency and connectivity graph. The obtained floorplans also satisfy boundary constraints ...

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 ...

This paper proposes a methodology for the automated construction of rectangular floorplans (RFPs) while addressing dimensional constraints and adjacency relations. Here, adjacency relations are taken in the form of a ...

This paper concerns the slow viscous flow through an aggregate of concentric clusters of porous cylindrical particles with Happel boundary condition. An aggregate of clusters of porous cylindrical particles is considered ...