A Stack-Free Traversal Algorithm for Left-Balanced k-d Trees

@article{Wald2022AST,
  title={A Stack-Free Traversal Algorithm for Left-Balanced k-d Trees},
  author={Ingo Wald},
  journal={ArXiv},
  year={2022},
  volume={abs/2210.12859}
}
  • I. Wald
  • Published 23 October 2022
  • Computer Science
  • ArXiv
We present an algorithm that allows for find-closest-point and kNN-style traversals of left-balanced k-d trees, without the need for either recursion or software-managed stacks; instead using only current and last previously traversed node to compute which node to traverse next. 
[PDF] Semantic Reader

Figures and Tables from this paper

References

SHOWING 1-10 OF 13 REFERENCES

GPU-friendly, Parallel, and (Almost-)In-Place Construction of Left-Balanced k-d Trees

  • I. Wald
  • Computer Science, Mathematics
    ArXiv
  • 2022
An algorithm that allows for building left-balanced and complete k-d trees over k-dimensional points in a trivially parallel and GPU friendly way and uses O ( logN ) iterations.

Wide BVH traversal with a short stack

An algorithm for wide bounding volume hierarchy (BVH) traversal that uses a short stack of just a few entries and an extension to efficiently cull leaf nodes when a closer intersection has been found, which reduces ray primitive intersections by up to 14%.

Efficient stackless hierarchy traversal on GPUs with backtracking in constant time

This work shows that the next node in such a traversal actually can be determined in constant time and state memory, which reduces memory access during traversal and outperforms the fastest stack-based algorithms on GPUs.

The Design and Analysis of Spatial Data Structures

The design and analysis of spatial data structures and applications for predicting stock returns and remembering and imagining palestine identity and service manual are studied.

Dynamic Stackless Binary Tree Traversal

A novel algorithm for traversing a binary tree that does not require a stack and works with dynamic descent direction without restarting is presented, which will visit exactly the same sequence of nodes as a stack-based counterpart with extremely low computational overhead.

Stackless Multi‐BVH Traversal for CPU, MIC and GPU Ray Tracing

This paper introduces a novel stackless traversal algorithm for MBVHs with up to four‐way branching that replaces the stack with a small bitmask, supports dynamic ordered traversal, and has a low computation overhead.

Realistic Image Synthesis Using Photon Mapping

The creation of photorealistic images of three-dimensional models is central to computer graphics. Photon mapping, an extension of ray tracing, makes it possible to efficiently simulate global…

The Art in Computer Programming

Here the authors haven’t even started the project yet, and already they’re forced to answer many questions: what will this thing be named, what directory will it be in, what type of module is it, how should it be compiled, and so on.

Restart trail for stackless BVH traversal

A ray cast algorithm utilizing a hierarchical acceleration structure needs to perform a tree traversal in the hierarchy. In its basic form, executing the traversal requires a stack that holds the…

On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N)

  • I. WaldV. Havran
  • Computer Science
    2006 IEEE Symposium on Interactive Ray Tracing
  • 2006
This paper analyzes the state of the art in building good kd-trees for ray tracing, and proposes an algorithm that builds SAH kd -trees in O(N log N), the theoretical lower bound.