Drawing Graphs in the Plane with High Resolution

DOI10.1137/0222063zbMath0797.05042OpenAlexW2170071395WikidataQ54309553 ScholiaQ54309553MaRDI QIDQ3142593

Antonios Symvonis, Gerhard J. Woeginger, James Haralambides, Torben Hagerup, Michael Formann, Michael Kaufmann, Ermo Welzl, Frank Thompson Leighton

Publication date: 10 October 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0222063

zbMATH Keywords

NP-hardresolutionplanestraight line segmentsdrawings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)

Related Items (30)

Higher order Delaunay triangulations ⋮ The strength of weak proximity ⋮ Limitations on realistic hyperbolic graph drawing ⋮ The Stub Resolution of 1-planar Graphs ⋮ Drawing planar graphs using the canonical ordering ⋮ New results on drawing angle graphs ⋮ Universal slope sets for 1-bend planar drawings ⋮ Combinatorial properties and recognition of unit square visibility graphs ⋮ How to draw a planar clustered graph ⋮ The Complexity of Angular Resolution ⋮ Drawing subcubic planar graphs with four slopes and optimal angular resolution ⋮ An annotated review on graph drawing and its applications ⋮ On the Complexity of the Planar Slope Number Problem ⋮ Drawing partial 2-trees with few slopes ⋮ On Vertex- and Empty-Ply Proximity Drawings ⋮ Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles ⋮ A heuristic approach towards drawings of graphs with high crossing resolution ⋮ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles ⋮ Signature of power graphs ⋮ A survey on the distance-colouring of graphs ⋮ Square-Orthogonal Drawing with Few Bends per Edge ⋮ Drawing planar graphs with circular arcs ⋮ The Straight-Line RAC Drawing Problem Is NP-Hard ⋮ Unnamed Item ⋮ Triangulations with Circular Arcs ⋮ Graphs with large total angular resolution ⋮ Graphs with large total angular resolution ⋮ Advances in the theory and practice of graph drawing ⋮ Radiocoloring in planar graphs: Complexity and approximations ⋮ Angular Resolutions: Around Vertices and Crossings

This page was built for publication: Drawing Graphs in the Plane with High Resolution