Sciweavers

605 search results - page 60 / 121
» Geometrical Structure of Boosting Algorithm
Sort
View
CGF
1999
125views more  CGF 1999»
15 years 27 days ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
CVPR
2007
IEEE
16 years 3 months ago
The Hierarchical Isometric Self-Organizing Map for Manifold Representation
We present an algorithm, Hierarchical ISOmetric SelfOrganizing Map (H-ISOSOM), for a concise, organized manifold representation of complex, non-linear, large scale, high-dimension...
Haiying Guan, Matthew Turk
139
Voted
NIPS
2001
15 years 2 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
CIKM
1994
Springer
15 years 5 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet
VMV
2003
163views Visualization» more  VMV 2003»
15 years 2 months ago
Real-Time Volumetric Intersections of Deforming Objects
We present a new algorithm for the computation of volumetric intersections of geometrically complex objects, which can be used for the efficient detection of collisions. Our appr...
Bruno Heidelberger, Matthias Teschner, Markus H. G...