4 search results - page 1 / 1 » An Algorithm to Construct Greedy Drawings of Triangulations |
GD
2008
Springer
13 years 7 months ago
2008
Springer
SODA
2008
ACM
13 years 7 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...
RT
1999
Springer
13 years 10 months ago
1999
Springer
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
OA
1989
13 years 10 months ago
1989
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...