431 search results - page 42 / 87 » Bold Graph Drawings |
107
click to vote
GD
2005
Springer
15 years 6 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...
122
Voted
PAMI
2002
15 years 6 days 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...
114
Voted
SODA
2008
ACM
15 years 2 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...
115
Voted
SMA
2008
ACM
14 years 11 months ago
2008
ACM
View identification is the basal process for solid reconstruction from engineering drawings. A new method is presented to label various views from a section-involved drawing and i...
138
Voted
COMGEO
2011
ACM
14 years 7 months ago
2011
ACM
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...