Sciweavers

2414 search results - page 239 / 483
» Computing Normal Subgroups
Sort
View
SGP
2004
14 years 1 months ago
Shape Segmentation Using Local Slippage Analysis
We propose a method for segmentation of 3D scanned shapes into simple geometric parts. Given an input point cloud, our method computes a set of components which possess one or mor...
Natasha Gelfand, Leonidas J. Guibas
SGP
2003
14 years 4 hour ago
Statistical Point Geometry
We propose a scheme for modeling point sample geometry with statistical analysis. In our scheme we depart from the current schemes that deterministically represent the attributes ...
Aravind Kalaiah, Amitabh Varshney
CG
2007
Springer
13 years 10 months ago
A fast all nearest neighbor algorithm for applications involving large point-clouds
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
Jagan Sankaranarayanan, Hanan Samet, Amitabh Varsh...
FGCS
2007
89views more  FGCS 2007»
13 years 10 months ago
Federated grid clusters using service address routed optical networks
Clusters of computers have emerged as cost-effective parallel and/or distributed computing systems for computationally intensive tasks. Normally, clusters are composed of high per...
Isaac D. Scherson, Daniel S. Valencia, Enrique Cau...
ICCV
2001
IEEE
15 years 17 days ago
The Variable Bandwidth Mean Shift and Data-Driven Scale Selection
We present two solutions for the scale selection problem in computer vision. The rst one is completely nonparametric and is based on the the adaptive estimation of the normalized ...
Dorin Comaniciu, Visvanathan Ramesh, Peter Meer