Sciweavers

2262 search results - page 2 / 453
» Points with large quadrant-depth
Sort
View
ICRA
2009
IEEE
163views Robotics» more  ICRA 2009»
13 years 12 months ago
On fast surface reconstruction methods for large and noisy point clouds
— In this paper we present a method for fast surface reconstruction from large noisy datasets. Given an unorganized 3D point cloud, our algorithm recreates the underlying surface...
Zoltan Csaba Marton, Radu Bogdan Rusu, Michael Bee...
JAIR
2006
160views more  JAIR 2006»
13 years 5 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
JPDC
2007
138views more  JPDC 2007»
13 years 5 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
WAE
2000
128views Algorithms» more  WAE 2000»
13 years 6 months ago
Planar Point Location for Large Data Sets: To Seek or Not to Seek
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket metho...
Jan Vahrenhold, Klaus Hinrichs
SIGGRAPH
2000
ACM
13 years 9 months ago
QSplat: a multiresolution point rendering system for large meshes
Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and ...
Szymon Rusinkiewicz, Marc Levoy