Rectilinear Duals Using Monotone Staircase Polygons

DOI10.1007/978-3-319-12691-3_8zbMath1332.68165OpenAlexW2168513947MaRDI QIDQ2942384

Yi-Jun Chang, Hsu-Chun Yen

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_8

zbMATH Keywords

rectilinear polygonplane graphfloorplanningrectilinear dual

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Unnamed Item

Cites Work

• Linear-time algorithms for hole-free rectilinear proportional contact graph representations
• Drawing slicing graphs with face areas
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• A simple optimal binary representation of mosaic floorplans and Baxter permutations
• Area-Universal and Constrained Rectangular Layouts
• Rectangular duals of planar graphs
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• Compact floor-planning via orderly spanning trees
• Orthogonal Cartograms with Few Corners Per Face
• Computing cartograms with optimal complexity

This page was built for publication: Rectilinear Duals Using Monotone Staircase Polygons