Sciweavers

665 search results - page 31 / 133
» Algorithms for Triangulated Terrains
Sort
View
PAMI
2006
202views more  PAMI 2006»
14 years 9 months ago
Pose and Motion Recovery from Feature Correspondences and a Digital Terrain Map
A novel algorithm for pose and motion estimation using corresponding features and a Digital Terrain Map is proposed. Using a Digital Terrain (or Digital Elevation) Map (DTM/DEM) as...
Ronen Lerner, Ehud Rivlin, Héctor Rotstein
WSCG
2004
205views more  WSCG 2004»
14 years 11 months ago
Visualisation System Based on Image Warping and Delaunay Triangulation of the Space
In this article we present a visualisation algorithm based on image warping. A source data for the algorithm is a set of images with colour and depth information rendered for the ...
Przemyslaw Kozankiewicz
WADS
1993
Springer
115views Algorithms» more  WADS 1993»
15 years 1 months ago
Parallel Construction of Quadtrees and Quality Triangulations
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(log n) for p...
Marshall W. Bern, David Eppstein, Shang-Hua Teng
COMPGEOM
2004
ACM
15 years 3 months ago
A 2D kinetic triangulation with near-quadratic topological changes
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
Pankaj K. Agarwal, Yusu Wang, Hai Yu
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
14 years 11 months ago
Greedy drawings of triangulations
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...
Raghavan Dhandapani