Bounds on the crossing resolution of complete geometric graphs

DOI10.1016/j.dam.2011.09.016zbMath1237.05050WikidataQ62042447 ScholiaQ62042447MaRDI QIDQ765347

Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Walter Didimo, Emilio Di Giacomo

Publication date: 19 March 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.09.016

zbMATH Keywords

geometric graphs; complete graphs; crossing resolution

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

Angular Resolutions: Around Vertices and Crossings, Vertex angle and crossing angle resolution of leveled tree drawings, A greedy heuristic for crossing-angle maximization, Right angle crossing graphs and 1-planarity

Cites Work

• A characterization of complete bipartite RAC graphs
• Geometric representation of cubic graphs with four directions
• Drawing cubic graphs with at most five slopes
• Bounded-degree graphs have arbitrarily large geometric thickness
• Bounded-degree graphs can have arbitrarily large slope numbers
• Graphs that Admit Right Angle Crossing Drawings
• Drawing Graphs with Right Angle Crossings
• Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings
• Geometric Thickness of Complete Graphs
• On the Perspectives Opened by Right Angle Crossing Drawings