The crossing-angle resolution in graph drawing

DOI10.1007/978-1-4614-0110-0_10MaRDI QIDQ2849803zbMATH OpenOpenAlexWikidataFDO

Authors Walter Didimo, Giuseppe Liotta

Publication date 25 September 2013

Published in Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-0110-0_10

zbMATH Keywords

crossing-angle resolutiongraph drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Bounds on the crossing resolution of complete geometric graphs
• A heuristic approach towards drawings of graphs with high crossing resolution
• The Complexity of Angular Resolution
• Crossing angles of geometric graphs
• Crossing angles of geometric graphs

Cited in

(29)

• New results on drawing angle graphs
• Drawing subcubic planar graphs with four slopes and optimal angular resolution
• A heuristic approach towards drawings of graphs with high crossing resolution
• A greedy heuristic for crossing-angle maximization
• Gap-planar graphs
• Right angle crossing graphs and 1-planarity
• Embedding-preserving rectangle visibility representations of nonplanar graphs
• Efficient generation of different topological representations of graphs beyond-planarity
• Fan-planarity: properties and complexity
• Area requirement of graph drawings with few crossings per edge
• Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
• Simultaneous visibility representations of plane st-graphs using L-shapes
• Maximizing the total resolution of graphs
• Crossing angles of geometric graphs
• A note on 1-planar graphs
• scientific article; zbMATH DE number 1974119 (Why is no real title available?)
• Vertex angle and crossing angle resolution of leveled tree drawings
• 2-layer right angle crossing drawings
• Right Angle Crossing Drawings of Graphs
• 2-Layer k-Planar Graphs
• A linear-time algorithm for finding induced planar subgraphs
• Efficient generation of different topological representations of graphs beyond-planarity
• Crossing angles of geometric graphs
• Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
• RAC-Drawability is ∃ℝ-complete and Related Results
• Bounds on the crossing resolution of complete geometric graphs
• RAC drawings in subcubic area
• L-visibility drawings of IC-planar graphs
• Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs

This page was built for publication: The crossing-angle resolution in graph drawing

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