Sciweavers

665 search results - page 68 / 133
» Algorithms for Triangulated Terrains
Sort
View
ISD
1999
Springer
149views Database» more  ISD 1999»
15 years 2 months ago
Cost-Effective Determination of Biomass from Aerial Images
This paper describes an ongoing collaborative research program between the Computer Science and the Forestry and Wildlife Management Departments at the University of Massachusetts...
Howard J. Schultz, Dana Slaymaker, Chris Holmes, F...
AMAI
2008
Springer
14 years 10 months ago
The giving tree: constructing trees for efficient offline and online multi-robot coverage
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
Noa Agmon, Noam Hazon, Gal A. Kaminka
SIBGRAPI
2003
IEEE
15 years 3 months ago
Moving Least Squares Multiresolution Surface Approximation
We describe a new method for surface reconstruction based on unorganized point clouds without normals. We also present a new algorithm for refining the inital triangulation. The o...
Boris Mederos, Luiz Velho, Luiz Henrique de Figuei...
COMGEO
2007
ACM
14 years 9 months ago
An incremental algorithm for reconstruction of surfaces of arbitrary codimension
A new algorithm is presented for surface reconstruction from unorganized points. Unlike many previous algorithms, this algorithm does not select a subcomplex of the Delaunay Trian...
Daniel Freedman
JMLR
2010
118views more  JMLR 2010»
14 years 4 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano