| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418490 | Discrete Applied Mathematics | 2012 | 8 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Emilio Di Giacomo, Walter Didimo, Peter Eades, Seok-Hee Hong, Giuseppe Liotta,