Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
EGH
2010
Springer
10 years 23 days ago
Parallel SAH k-D tree construction
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...
NIPS
2007
10 years 4 months ago
Learning the structure of manifolds using random projections
We present a simple variant of the k-d tree which automatically adapts to intrinsic low dimensional structure in data.
Yoav Freund, Sanjoy Dasgupta, Mayank Kabra, Nakul ...
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
10 years 6 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
3DIM
2003
IEEE
10 years 6 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
VRST
2003
ACM
10 years 8 months ago
Partitioning crowded virtual environments
We investigate several techniques that partition a crowded virtual environment into regions that can be managed by separate servers or mapped onto different multicast groups. When...
Anthony Steed, Roula Abou-Haidar
books