Notes on large angle crossing graphs

DOI10.4086/CJTCS.2011.004MaRDI QIDQ5414593zbMATH OpenOpenAlexFDO

Authors Vida Dujmović, Joachim Gudmundsson, Pat Morin, Thomas Wolle

Publication date 6 May 2014

Published in Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/cjtcs.2011.004

zbMATH Keywords

edge crossing anglegeometric graphsnumber of edgesupper and lower bounds

Mathematics Subject Classification ID

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

Recommendations

• Graphs that admit right angle crossing drawings
• Graphs that admit right angle crossing drawings
• On RAC drawings of graphs with one bend per edge
• Right angle crossing graphs and 1-planarity
• On the perspectives opened by right angle crossing drawings

Cited in

(27)

• A heuristic approach towards drawings of graphs with high crossing resolution
• A greedy heuristic for crossing-angle maximization
• Right angle crossing graphs and 1-planarity
• Fan-planarity: properties and complexity
• On the density of non-simple 3-planar graphs
• Graphs that admit right angle crossing drawings
• Crossing angles of geometric graphs
• A note on 1-planar graphs
• Vertex angle and crossing angle resolution of leveled tree drawings
• 2-layer right angle crossing drawings
• Large angle crossing drawings of planar graphs in subquadratic area
• Right Angle Crossing Drawings of Graphs
• Angular Resolutions: Around Vertices and Crossings
• Crossing Layout in Non-planar Graph Drawings
• Crossing angles of geometric graphs
• scientific article; zbMATH DE number 7651192 (Why is no real title available?)
• Graphs with large total angular resolution
• Graphs with large total angular resolution
• RAC-Drawability is ∃ℝ-complete and Related Results
• Area, curve complexity, and crossing resolution of non-planar graph drawings
• Nonplanar Graph Drawings with k Vertices per Face
• Min-\(k\)-planar drawings of graphs
• On RAC drawings of graphs with two bends per edge
• Plane multigraphs with one-bend and circular-arc edges of a fixed angle
• Min-k-planar drawings of graphs
• On RAC drawings of graphs with two bends per edge
• Edge densities of drawings of graphs with one forbidden cell

This page was built for publication: Notes on large angle crossing graphs

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