Rectangular drawings of plane graphs without designated corners

DOI10.1016/S0925-7721(01)00061-XzbMath0993.68131MaRDI QIDQ5959556

Shin-ichi Nakano, Takao Nishizeki, Md. Saidur Rahman

Publication date: 20 May 2002

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

zbMATH Keywords

graph drawingrectangular drawings

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

Drawings of planar graphs with few slopes and segments ⋮ Aspect ratio universal rectangular layouts ⋮ An annotated review on graph drawing and its applications ⋮ Unnamed Item ⋮ Rectangular-radial drawings of cubic plane graphs ⋮ Spherical-Rectangular Drawings ⋮ INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS ⋮ Algorithms for Drawing Planar p-petal Graphs

Cites Work

• On area-efficient drawings of rectangular duals for VLSI floor-plan
• A linear algorithm to find a rectangular dual of a planar triangulated graph
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• Rectangular grid drawings of plane graphs
• An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
• On Finding the Rectangular Duals of Planar Triangular Graphs
• A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
• Box-Rectangular Drawings of Plane Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rectangular drawings of plane graphs without designated corners