Sciweavers

665 search results - page 51 / 133
» Algorithms for Triangulated Terrains
Sort
View
ATAL
2009
Springer
15 years 2 months ago
On fast exploration in 2D and 3D terrains with multiple robots
We present a fast multi-robotic exploration methodology for 2D and 3D terrains. An asynchronous exploration strategy is introduced which shows significant improvements over the ex...
Rahul Sawhney, K. Madhava Krishna, Kannan Srinatha...
WSCG
2004
190views more  WSCG 2004»
14 years 11 months ago
Scalable Compression and Rendering of Textured Terrain Data
Several sophisticated methods are available for efficient rendering of out-of-core terrain data sets. For huge data sets the use of preprocessed tiles has proven to be more effici...
Roland Wahl, Manuel Massing, Patrick Degener, Mich...
CGF
2007
126views more  CGF 2007»
14 years 9 months ago
A Lagrangian Approach to Dynamic Interfaces through Kinetic Triangulation of the Ambient Space
In this paper, we propose a robust and efficient Lagrangian approach for modeling dynamic interfaces between different materials undergoing large deformations and topology change...
Jean-Philippe Pons, Jean-Daniel Boissonnat
SMA
2008
ACM
110views Solid Modeling» more  SMA 2008»
14 years 9 months ago
Probabilistic model of triangulation
This paper analyses the probability that randomly deployed sensor nodes triangulate any point within the target area. Its major result is the probability of triangulation for any p...
Xiaoyun Li, David K. Hunter
AAAI
2007
15 years 3 days ago
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
Subhash Suri, Elias Vicari, Peter Widmayer