219 search results - page 19 / 44 » Drawing with Fat Edges |
GD
2004
Springer
14 years 27 days ago
2004
Springer
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
An important research area in computer vision is developing
algorithms that can reconstruct the 3D surface of an object
represented by a single 2D line drawing. Previous work
on...
PAMI
2002
13 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...
GD
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
SODA
2008
ACM
13 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...