On the Angular Resolution of Planar Graphs

DOI10.1137/S0895480193242931MaRDI QIDQ4296511zbMATH OpenOpenAlexFDO

Authors S. Malitz, Achilleas Papakostas

Publication date 9 November 1995

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

angular resolutioncircle packingdisk packingouterplanar graphsplanar graphstraight-line drawingtriangulations

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• SOFSEM 2005: Theory and Practice of Computer Science
• Graphs with large total angular resolution
• Drawing Graphs in the Plane with High Resolution
• The Complexity of Angular Resolution
• Drawing planar graphs with circular arcs

Cited in

(39)

• Advances in the theory and practice of graph drawing
• Triangulating planar graphs while minimizing the maximum degree
• New results on drawing angle graphs
• Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
• Drawing planar graphs using the canonical ordering
• Limitations on realistic hyperbolic graph drawing
• Drawing partial 2-trees with few slopes
• Optimal angular resolution for face-symmetric drawings
• On the complexity of the planar slope number problem
• scientific article; zbMATH DE number 2084293 (Why is no real title available?)
• Optimal 3D angular resolution for low-degree graphs
• The straight-line RAC drawing problem is NP-hard
• Pinning balloons with perfect angles and optimal area
• Force-directed Lombardi-style graph drawing
• On Angles and Perturbations of Graphs
• On vertex- and empty-ply proximity drawings
• Experimental analysis of the accessibility of drawings with few segments
• Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
• A Note on Rectilinearity and Angular Resolution
• Circle packings of maps —The Euclidean case
• Optimal 3D angular resolution for low-degree graphs
• Experimental analysis of the accessibility of drawings with few segments
• Angular Resolutions: Around Vertices and Crossings
• The stub resolution of 1-planar 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
• How to draw a planar clustered graph
• Computing vertex resolvability of some regular planar graphs
• On-line convex planarity testing
• Complexity analysis of balloon drawing for rooted trees
• Circle patterns with the combinatorics of the square grid
• Weakly leveled planarity with bounded span
• Weakly leveled planarity with bounded span
• A note on isosceles planar graph drawing
• The strength of weak proximity
• Upward drawings of triconnected digraphs.

This page was built for publication: On the Angular Resolution of Planar Graphs

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