Back to Search
Start Over
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings.
- Source :
-
Theory of Computing Systems . Oct2011, Vol. 49 Issue 3, p565-575. 11p. - Publication Year :
- 2011
-
Abstract
- In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 14324350
- Volume :
- 49
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Theory of Computing Systems
- Publication Type :
- Academic Journal
- Accession number :
- 63234399
- Full Text :
- https://doi.org/10.1007/s00224-010-9275-6