188 search results - page 20 / 38 » Pointed Drawings of Planar Graphs |
196
Voted
GD
2007
Springer
16 years 1 months ago
2007
Springer
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawi...
210
Voted
GD
2003
Springer
16 years 21 days ago
2003
Springer
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
196
click to vote
GD
2005
Springer
16 years 1 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
220
click to vote
PAMI
2002
15 years 7 months ago
2002
A straightforward way to illustrate a 3D model is to use a line drawing. Faces in a 2D line drawing provide important information for reconstructing its 3D geometry. Manifold objec...
212
click to vote
SODA
2008
ACM
15 years 9 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...