A Coloring Algorithm for Disambiguating Graph and Map Drawings
Drawings of non-planar graphs always result in edge crossings. When there are many edges crossing at small angles, it is often difficult to follow these edges, because of the multiple visual paths resulted from the crossings that slow down eye movements. In this paper we propose an algorithm that di...
| Veröffentlicht in: | IEEE transactions on visualization and computer graphics. - 1996. - 25(2019), 2 vom: 29. Feb., Seite 1321-1335 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2019
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on visualization and computer graphics |
| Schlagworte: | Journal Article |
| Online verfügbar |
Volltext |