219 search results - page 1 / 44 » Drawing with Fat Edges |
GD
2001
Springer
13 years 9 months ago
2001
Springer
COMGEO
2006
ACM
13 years 5 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
IV
2005
IEEE
13 years 10 months ago
2005
IEEE
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the ...
SC
2004
ACM
13 years 10 months ago
2004
ACM
As the network speed grows, inter-layer coordination becomes more important. This paper shows 3 inter-layer coordination methods; (1) “Comet-TCP”; cooperation of datalink laye...