. [. Andrews, Further comparison algorithms for geometric intersection problems, 6 th International Symposium on Spatial Data Handling, 1994.

M. [. Asano, H. Edahiro, M. Imai, and . Iri, Practical use of bucketing techniques in computational geometry [Caz97] F. Cazals. Combinatorial properties of onedimensional arrangements Drettakis, and C. Puech. Filtering, clustering and hierarchy construction: a new solution for ray-tracing complex scenes, Computational Geometry EG'95CS97] F. Cazals and M. Sbert. Some integral geometry tools to estimate the complexity of 3d scenes. In preparation, 1985.

M. [. Gottschalk, D. Lin, and . Manocha, OBBTree, Proceedings of the 23rd annual conference on Computer graphics and interactive techniques , SIGGRAPH '96, pp.42-51, 1980.
DOI : 10.1145/237170.237244

J. Mitchell, D. Mount, S. [. Suri, ]. F. O-'rourkeps85, M. I. Preparata et al., Query-sensitive ray shooting Stony Brook The grid file: an adaptable, symmetric multikey file structure Computational Geometry in C Computational Geometry: An Introduction Integral geometry and geometric probability An integral geometry based method for fast form-factor computation. Computer Graphics Forum -Eurographics [SD95a] François X. Sillion and George Drettakis. Featurebased control of visibility error: A multi-resolution clustering algorithm for global illumination A comparison of sequential delaunay triangulation algorithms, 10 th ACM CG SIG- GRAPH 95 Proc. of the 11 th ACM Symp. on Computational GeometryWu92] X. Wu. A linear-time simple bounding volume algorithm . Graphics Gem, III, pp.359-36838, 1976.