SAH KD-Tree Construction on GPU

@inproceedings{Wu2011SAHKC,
  title={SAH KD-Tree Construction on GPU},
  author={Zhefeng Wu and Fukai Zhao and Xinguo Liu},
  booktitle={High Performance Graphics},
  year={2011}
}
KD-tree is one of the most efficient acceleration data structures for ray tracing. In this paper, we present a kd-tree construction algorithm that is precisely SAH-optimized and runs entirely on GPU. We construct the tree nodes in breadth-first order. In order to precisely evaluate the SAH cost, we design a parallel scheme based on the standard parallel scan primitive to count the triangle numbers for all split candidates, and a bucket-based algorithm to sort the AABBs (axis-aligned bounding… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 32 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Parallel SAH k-D tree construction

  • High Performance Graphics
  • 2010
VIEW 15 EXCERPTS
HIGHLY INFLUENTIAL

Scan primitives for GPU computing

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

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

  • 2006 IEEE Symposium on Interactive Ray Tracing
  • 2006
VIEW 14 EXCERPTS
HIGHLY INFLUENTIAL

Heuristic ray shooting algorithms

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Automatic Creation of Object Hierarchies for Ray Tracing

  • IEEE Computer Graphics and Applications
  • 1987
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…