665 search results - page 11 / 133 » Algorithms for Triangulated Terrains |
ISAAC
1999
Springer
13 years 11 months ago
1999
Springer
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
WSCG
2003
13 years 8 months ago
2003
Large terrain databases require a great number of polygons and textures. In consequence, transmission of terrain data over slow networks is still worrying. Multiresolution models ...
COMPGEOM
2000
ACM
13 years 11 months ago
2000
ACM
For a sufficiently dense set of points in any closed Riemannian manifold, we prove that a unique Delannay triangulation exists. This triangulation has the same properties as in Eu...
AMC
2005
13 years 7 months ago
2005
This paper investigates the implementation of a functional language algorithm for the divide-and-conquer Delaunay triangulation. The global aim is to improve its performance. Up t...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...