Sciweavers

665 search results - page 4 / 133
» Algorithms for Triangulated Terrains
Sort
View
CCCG
1998
13 years 8 months ago
A modified longest side bisection triangulation
Fast and efficient exploration of large terrains in a virtual reality manner requires different levels of detail to speedup processing of terrain parts in background. Thus, the tr...
Christoph Stamm, Stephan Eidenbenz, Renato Pajarol...
SODA
1992
ACM
179views Algorithms» more  SODA 1992»
13 years 8 months ago
Approximating the Minimum Weight Triangulation
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
David Eppstein
ACSC
2010
IEEE
13 years 2 months ago
Efficient contour line labelling for terrain modelling
Terrains are an essential part of outdoor environments. Terrain models are important for computer games and applications in architecture, urban design and archaeology. A popular a...
Xin Xie, Burkhard Wünsche
VISUALIZATION
1997
IEEE
13 years 11 months ago
ROAMing terrain: real-time optimally adapting meshes
Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraf...
Mark A. Duchaineau, Murray Wolinsky, David E. Sige...
CORR
2007
Springer
143views Education» more  CORR 2007»
13 years 7 months ago
An Approximation Algorithm for Shortest Descending Paths
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Anna Lubiw