Bounds on the crossing resolution of complete geometric graphs
Date
2012
Authors
Di Giacomo, E.
Didimo, W.
Eades, P.
Hong, S.H.
Liotta, G.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Discrete Applied Mathematics, 2012; 160(1-2):132-139
Statement of Responsibility
Conference Name
Abstract
The crossing resolution of a geometric graph is the minimum crossing angle at which any two edges cross each other. In this paper, we present upper and lower bounds to the crossing resolution of the complete geometric graphs.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2011 Elsevier BV