An algorithm for straight-line drawing of planar graphs

DOI10.1007/PL00009189zbMath0895.68105MaRDI QIDQ1386370

D. Massart

Publication date: 2 September 2002

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

planar graphsgraph drawingvisual languages

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario ⋮ Performing Multicut on Walkable Environments ⋮ An annotated review on graph drawing and its applications ⋮ Bitonic st-orderings for Upward Planar Graphs ⋮ \(\mathsf{T}\)-shape visibility representations of 1-planar graphs ⋮ Transcript design problem of oritatami systems ⋮ Compact drawings of 1-planar graphs with right-angle crossings and few bends ⋮ Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints ⋮ Drawing graphs as spanners ⋮ Graph layout for applications in compiler construction

Uses Software

• Algorithm 447