Pinki Pinki
ABSTRACT
Let G = (V, E) be a maximal planar graph (MPG), where every face is triangular. A floor plan (FP) of an n-vertex MPG G is a partition of a rectangle into n rectilinear polygons called modules where two modules are adjacent if and only if there is an edge between the corresponding vertices in G. It can be easily found that it is not possible to construct a FP for a given MPG while maintaining the rectangularity of the modules of a FP (for an example, consider the complete graph K4). Hence, to satisfy adjacency requirements of a MPG, bends need to be introduced within the FPs, where a bend is a concave corner of a module in a FP. A FP with rectilinear modules or with at least one bend is called orthogonal floor plan (OFP). There exist algorithms for the construction of an OFP for a given MPG but the notion of minimum bends within an OFP is not yet discussed in the literature. In this paper, a mathematical procedure for computing the minimum number of bends required in an OFP for a MPG G has been presented. Further, it has been shown that the number of bends in an OFP depends only on critical separating triangles and K4’s.
- Md Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G Kobourov, and Torsten Ueckerdt. 2013. Computing cartograms with optimal complexity. Discrete & Computational Geometry 50, 3 (2013), 784–810.Google Scholar
Digital Library
- Ilker Baybars and Charles M Eastman. 1980. Enumerating architectural arrangements by generating their underlying graphs. Environment and Planning B: Planning and Design 7, 3 (1980), 289–310.Google ScholarCross Ref
- Jayaram Bhasker and Sartaj Sahni. 1987. A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph. Networks 17, 3 (1987), 307–317.Google ScholarCross Ref
- Jayaram Bhasker and Sartaj Sahni. 1988. A linear algorithm to find a rectangular dual of a planar triangulated graph. Algorithmica 3, 2 (1988), 247–278.Google ScholarDigital Library
- Yi-Jun Chang and Hsu-Chun Yen. 2014. Rectilinear Duals Using Monotone Staircase Polygons. In In: Zhang Z., Wu L., Xu W., Du DZ. (eds) Combinatorial Optimization and Applications. COCOA 2014. Lecture Notes in Computer Science, Vol. 8881. Springer,Cham, 86–100. doi: 10.1007/978-3-319-12691-3_8.Google ScholarDigital Library
- Jonathan L Gross and Jay Yellen. 2005. Graph theory and its applications. CRC press.Google Scholar
- Xin He. 1993. On finding the rectangular duals of planar triangular graphs. SIAM J. Comput. 22, 6 (1993), 1218–1226.Google ScholarDigital Library
- Xin He. 1999. On floor-plan of plane graphs. SIAM J. Comput. 28, 6 (1999), 2150–2167.Google ScholarDigital Library
- Mohammad Reza Akbari Jokar and Ali Shoja Sangchooli. 2011. Constructing a block layout by face area. The International Journal of Advanced Manufacturing Technology 54, 5-8(2011), 801–809.Google Scholar
- Krzysztof Koźmiński and Edwin Kinnen. 1985. Rectangular duals of planar graphs. Networks 15, 2 (1985), 145–157.Google ScholarCross Ref
- Maciej Kurowski. 2003. Simple and efficient floor-planning. Information processing letters 86, 3 (2003), 113–119.Google Scholar
- Peter Hirsch Levin. 1964. Use of graphs to decide the optimum layout of buildings. The Architects’ Journal 7 (1964), 809–815.Google Scholar
- Chien-Chih Liao, Hsueh-I Lu, and Hsu-Chun Yen. 2003. Compact floor-planning via orderly spanning trees. Journal of Algorithms 48, 2 (2003), 441–451.Google ScholarDigital Library
- I Rinsma. 1988. Rectangular and orthogonal floor plans with required room areas and tree adjacency. Environment and Planning B: Planning and Design 15, 1 (1988), 111–118.Google ScholarCross Ref
- Yachyang Sun and Majid Sarrafzadeh. 1993. Floor planning by graph dualization: L-shaped modules. Algorithmica 10, 6 (1993), 429–456.Google ScholarDigital Library
- Torsten Ueckerdt. 2012. Geometric representations of graphs with low polygonal complexity. Phd thesis, Department of Mathematics at TU Berlin (2012). https://i11www.iti.kit.edu_media/members/torsten_ueckerdt/torsten_ueckerdt-phd_thesis.pdf/Google Scholar
- Kok-Hoo Yeap and Majid Sarrafzadeh. 1993. Floor-planning by graph dualization: 2-concave rectilinear modules. SIAM J. Comput. 22, 3 (1993), 500–526.Google ScholarDigital Library
Index Terms
- Characterization of Graphs Based on Number of Bends in Corresponding Floor plans
Recommendations
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs
In 1956, W.T. Tutte proved that every 4-connected planar graph is hamiltonian. Moreover, in 1997, D.P. Sanders extended this to the result that a 4-connected planar graph contains a hamiltonian cycle through any two of its edges. It is shown that ...
On dominating sets of maximal outerplanar and planar graphs
A set D V ( G ) of a graph G is a dominating set if every vertex v V ( G ) is either in D or adjacent to a vertex in D . The domination number γ ( G ) of a graph G is the minimum cardinality of a dominating set of G . Campos and Wakabayashi (2013) and ...
Largest planar graphs and largest maximal planar graphs of diameter two
Selected papers of the international symposium on applied mathematics, August 2000, Dalian, ChinaLet fk(Δ) be the maximum number of vertices in a planar graph with diameter k and maximum degree Δ. Let gk(Δ) be the maximum number of vertices in a maximal planar graph with diameter k and maximum degree Δ. Seyffarth has shown that g2=⌊3Δ/2+1⌋ for Δ ≥ ...
Comments