285 search results - page 12 / 57 » New Ways to Construct Binary Search Trees |
131
click to vote
EGH
2011
Springer
13 years 11 months ago
2011
Springer
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
DAC
2003
ACM
16 years 19 days ago
2003
ACM
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...
DAGM
2005
Springer
15 years 5 months ago
2005
Springer
The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing devi...
117
click to vote
COCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
102
click to vote
IJCV
2008
14 years 11 months ago
2008
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...