Drawing Graphs in the Plane with High Resolution

DOI10.1137/0222063MaRDI QIDQ3142593zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Antonios Symvonis, Gerhard J. Woeginger, F. Thomson Leighton, Emo Welzl

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

drawingsNP-hardplaneresolutionstraight line segments

Mathematics Subject Classification ID

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) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Drawing plane graphs nicely
• Algorithms and Computation
• scientific article; zbMATH DE number 1693555
• Drawing planar graphs
• Drawing Planar Graphs with Large Vertices and Thick Edges
• Drawing Graphs on Few Lines and Few Planes
• Drawing graphs on few lines and few planes
• scientific article; zbMATH DE number 2084293
• Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution

Cited in

(42)

• Advances in the theory and practice of graph drawing
• New results on drawing angle graphs
• Higher order Delaunay triangulations
• Drawing subcubic planar graphs with four slopes and optimal angular resolution
• Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
• A heuristic approach towards drawings of graphs with high crossing resolution
• Signature of power graphs
• Drawing planar graphs using the canonical ordering
• Dilation coefficient, plane-width, and resolution coefficient of graphs
• Limitations on realistic hyperbolic graph drawing
• Grid drawings of graphs with constant edge-vertex resolution
• Universal slope sets for 1-bend planar drawings
• A survey on the distance-colouring of graphs
• Radiocoloring in planar graphs: Complexity and approximations
• Bounded stub resolution for some maximal 1-planar graphs
• Drawing partial 2-trees with few slopes
• On the complexity of the planar slope number problem
• Maximizing the total resolution of graphs
• Optimal 3D angular resolution for low-degree graphs
• The straight-line RAC drawing problem is NP-hard
• On the Angular Resolution of Planar Graphs
• On vertex- and empty-ply proximity drawings
• Optimal 3D angular resolution for low-degree graphs
• Square-orthogonal drawing with few bends per edge
• Angular Resolutions: Around Vertices and Crossings
• The stub resolution of 1-planar graphs
• Angle covers: algorithms and complexity
• Combinatorial properties and recognition of unit square visibility graphs
• Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
• Triangulations with Circular Arcs
• Graphs with large total angular resolution
• Graphs with large total angular resolution
• Drawing planar graphs with circular arcs
• Combinatorial properties and recognition of unit square visibility graphs
• How to draw a planar clustered graph
• The Complexity of Angular Resolution
• An annotated review on graph drawing and its applications
• Weakly leveled planarity with bounded span
• Weakly leveled planarity with bounded span
• Ortho-radial drawing in near-linear time
• The stub resolution of 1-planar graphs
• The strength of weak proximity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142593)