Fixed-Location Circular Arc Drawing of Planar Graphs

DOI10.7155/JGAA.00140MaRDI QIDQ5301408zbMATH OpenOpenAlexWikidataFDO

Authors Cesim Erten, Stephen G. Kobourov, Alon Efrat

Publication date 19 January 2009

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/55408, http://www.emis.de/journals/JGAA/accepted/2007/EfratErtenKobourov2007.11.1.pdf

zbMATH Keywords

crossings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Graph Drawing
• scientific article; zbMATH DE number 1500677
• Drawing planar graphs with circular arcs
• Drawing graphs with few arcs
• Universal Point Sets for Drawing Planar Graphs with Circular Arcs

Cited in

(11)

• Placing segments on parallel arcs
• A framework and algorithms for circular drawings of graphs
• scientific article; zbMATH DE number 1500677 (Why is no real title available?)
• Graph Drawing
• Minimizing crossings in constrained two-sided circular graph layouts
• Universal Point Sets for Drawing Planar Graphs with Circular Arcs
• Drawing graphs with few arcs
• Triangulations with Circular Arcs
• Drawing planar graphs with circular arcs
• Untangling circular drawings: algorithms and complexity
• Angles of arc-polygons and lombardi drawings of cacti

This page was built for publication: Fixed-Location Circular Arc Drawing of Planar Graphs

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