On Floor-Plan of Plane Graphs
From MaRDI portal
Publication:4268862
DOI10.1137/S0097539796308874zbMath0935.05039WikidataQ29391691 ScholiaQ29391691MaRDI QIDQ4268862
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
algorithm; linear time algorithm; rectangles; rectangular dual; floor plan; triangulated planar graph
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
68W35: Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.)
05C75: Structural characterization of families of graphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Computing cartograms with optimal complexity, On \(k\)-greedy routing algorithms, Linear-time algorithms for hole-free rectilinear proportional contact graph representations, Improved floor-planning of graphs via adjacency-preserving transformations, Octagonal drawings of plane graphs with prescribed face areas, Planar polyline drawings via graph transformations, Optimal polygonal representation of planar graphs, Star Shaped Orthogonal Drawing, Star-Shaped and L-Shaped Orthogonal Drawings