High-Performance Elliptical Cone Tracing

Umut Emre

Aryan Kanak

Shlomi Steinberg

cite

BibTex ×

@article{emre2025cones,
 	title={High-Performance Elliptical Cone Tracing},
 	author={Emre, Umut and Kanak, Aryan and Steinberg, Shlomi},
 	journal={Computer Graphics Forum},
 	volume = {44},
 	number = {7},
 	publisher = {Wiley},
 	year = {2025},
 	month = {Oct},
 	doi = {10.1111/cgf.70230},
 }

copy to clipboard

Computer Graphics Forum (Proceedings of Pacific Graphics 2025)

Publication date: October 1st, 2025
doi: 10.1111/cgf.70230

Abstract

In this work, we discuss elliptical cone traversal in scenes that employ typical triangular meshes. We derive accurate and numerically-stable intersection tests for an elliptical conic frustum with an AABB, plane, edge and a triangle, and analyze the performance of elliptical cone tracing when using different acceleration data structures: SAH-based K-d trees, BVHs as well as a modern 8-wide BVH variant adapted for cone tracing, and compare with ray tracing. In addition, several cone traversal algorithms are analyzed, and we develop novel heuristics and optimizations that give better performance than previous traversal approaches. The results highlight the difference in performance characteristics between rays and cones, and serve to guide the design of acceleration data structures for applications that employ cone tracing.