665 search results - page 14 / 133 » Algorithms for Triangulated Terrains |
SODA
2001
ACM
13 years 8 months ago
2001
ACM
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
ICRA
2003
IEEE
14 years 21 days ago
2003
IEEE
In this paper we describe a software system built to coordinate an autonomous vehicle with variable configuration ability operating in rough terrain conditions. The paper describe...
DM
2006
13 years 7 months ago
2006
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...
VISUALIZATION
2002
IEEE
14 years 9 days ago
2002
IEEE
We present a technique to perform occlusion culling for hierarchical terrains at run-time. The algorithm is simple to implement and requires minimal pre-processing and additional ...
COMPGEOM
2009
ACM
14 years 2 days ago
2009
ACM
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...