Octagonal drawings of plane graphs with prescribed face areas

DOI10.1016/j.comgeo.2008.09.002zbMath1226.05103OpenAlexW2154015526MaRDI QIDQ1000923

Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki

Publication date: 12 February 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.09.002

zbMATH Keywords

algorithmgraph drawingoctagonal drawingprescribed face areaVLSI floorplanning

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Linear-time algorithms for hole-free rectilinear proportional contact graph representations ⋮ Orthogonal cartograms with at most 12 corners per face ⋮ An annotated review on graph drawing and its applications

Cites Work

• Unnamed Item
• Unnamed Item
• On area-efficient drawings of rectangular duals for VLSI floor-plan
• On rectangular cartograms
• Floorplanning by graph dualization: \(L\)-shaped modules
• Rectangular grid drawings of plane graphs
• On minimal-node-cost planar embeddings
• OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS
• Arboricity and Subgraph Listing Algorithms
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• On Floor-Plan of Plane Graphs
• Plane Cubic Graphs with Prescribed Face Areas
• A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
• Orthogonal Drawings of Plane Graphs Without Bends
• Sliceable Floorplanning by Graph Dualization
• Orthogonal Drawings for Plane Graphs with Specified Face Areas
• Graph-Theoretic Concepts in Computer Science
• Graph Drawing

This page was built for publication: Octagonal drawings of plane graphs with prescribed face areas