Drawing Graphs in the Plane with High Resolution

From MaRDI portal
Publication:3142593

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




Related Items

Higher order Delaunay triangulationsThe strength of weak proximityLimitations on realistic hyperbolic graph drawingThe Stub Resolution of 1-planar GraphsDrawing planar graphs using the canonical orderingNew results on drawing angle graphsUniversal slope sets for 1-bend planar drawingsCombinatorial properties and recognition of unit square visibility graphsHow to draw a planar clustered graphThe Complexity of Angular ResolutionDrawing subcubic planar graphs with four slopes and optimal angular resolutionAn annotated review on graph drawing and its applicationsOn the Complexity of the Planar Slope Number ProblemDrawing partial 2-trees with few slopesOn Vertex- and Empty-Ply Proximity DrawingsDrawing subcubic 1-planar graphs with few bends, few slopes, and large anglesA heuristic approach towards drawings of graphs with high crossing resolutionDrawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large AnglesSignature of power graphsA survey on the distance-colouring of graphsSquare-Orthogonal Drawing with Few Bends per EdgeDrawing planar graphs with circular arcsThe Straight-Line RAC Drawing Problem Is NP-HardUnnamed ItemTriangulations with Circular ArcsGraphs with large total angular resolutionGraphs with large total angular resolutionAdvances in the theory and practice of graph drawingRadiocoloring in planar graphs: Complexity and approximationsAngular Resolutions: Around Vertices and Crossings