The Crossing-Angle Resolution in Graph Drawing

Walter Didimo () and Giuseppe Liotta ()
Additional contact information
Walter Didimo: Università degli Studi di Perugia, Dipartimento di Ingegneria Elettronica e dell’Informazione
Giuseppe Liotta: Università degli Studi di Perugia, Dipartimento di Ingegneria Elettronica e dell’Informazione

A chapter in Thirty Essays on Geometric Graph Theory, 2013, pp 167-184 from Springer

Abstract: Abstract The crossing-angle resolution of a drawing of a graph measures the smallest angle formed by any pair of crossing edges. In this chapter, we survey some of the most recent results and discuss the current research agenda on drawings of graphs with good crossing-angle resolution.

Keywords: Graph Drawing; Upward Planar; Planar Straight-line Drawing; Complex Curve; Edge Crossings (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-0110-0_10

Ordering information: This item can be ordered from
http://www.springer.com/9781461401100

DOI: 10.1007/978-1-4614-0110-0_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().