Sciweavers

1082 search results - page 39 / 217
» Approximation Algorithms for Spreading Points
Sort
View
CGF
2010
198views more  CGF 2010»
14 years 12 months ago
Feature Preserving Mesh Generation from 3D Point Clouds
We address the problem of generating quality surface triangle meshes from 3D point clouds sampled on piecewise smooth surfaces. Using a feature detection process based on the cova...
Nader Salman, Mariette Yvinec, Quentin Méri...
ECCV
2006
Springer
16 years 1 months ago
Triangulation for Points on Lines
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
Adrien Bartoli, Jean-Thierry Lapresté
JPDC
2007
138views more  JPDC 2007»
14 years 11 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
ARITH
2007
IEEE
15 years 6 months ago
P6 Binary Floating-Point Unit
The floating point unit of the next generation PowerPC is detailed. It has been tested at over 5 GHz. The design supports an extremely aggressive cycle time of 13 FO4 using a tech...
Son Dao Trong, Martin S. Schmookler, Eric M. Schwa...
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
14 years 9 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud