41 search results - page 3 / 9 » The Path of a Triangulation |
CG
2005
Springer
13 years 5 months ago
2005
Springer
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
ISAAC
2000
Springer
13 years 9 months ago
2000
Springer
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
DCG
1999
13 years 5 months ago
1999
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
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...
IROS
2006
IEEE
13 years 11 months ago
2006
IEEE
— Current approaches to the visual homing for mobile robot navigation are generally inspired in insects’ behavior and based on the observed angular information of fixed points...