Some Integral Geometry Tools to Estimate the Complexity of 3D Scenes
暂无分享,去创建一个
[1] Herbert Solomon,et al. Geometric Probability , 1978, CBMS-NSF regional conference series in applied mathematics.
[2] Joseph O'Rourke,et al. Computational Geometry in C. , 1995 .
[3] François X. Sillion,et al. Accurate Error Bounds for Multi-Resolution Visibility , 1996, Rendering Techniques.
[4] J. Mccleary,et al. Geometry from a Differentiable Viewpoint: Recapitulation and coda , 1994 .
[5] L. M. M.-T.. Theory of Probability , 1929, Nature.
[6] Robert L. Scot Drysdale,et al. A comparison of sequential Delaunay triangulation algorithms , 1995, SCG '95.
[7] E. Harding,et al. Stochastic Geometry: A Tribute to the Memory of Rollo Davidson , 1974 .
[8] Claude Puech,et al. Bucket-like space partitioning data structures with applications to ray-tracing , 1997, SCG '97.
[9] J. Thorpe. Elementary Topics in Differential Geometry , 1979 .
[10] B. Chazelle. Lower bounds on the complexity of polytope range searching , 1989 .
[11] Mateu Sbert,et al. An Integral Geometry Based Method for Fast Form‐Factor Computation , 1993, Comput. Graph. Forum.
[12] George Drettakis,et al. Filtering, Clustering and Hierarchy Construction: a New Solution for Ray‐Tracing Complex Scenes , 1995, Comput. Graph. Forum.
[13] Luc Devroye,et al. Lecture Notes on Bucket Algorithms , 1986, Progress in Computer Science.
[14] Frédéric Cazals. Combinatorial Properties of One-Dimensional Arrangements , 1997, Exp. Math..
[15] François X. Sillion,et al. A Unified Hierarchical Algorithm for Global Illumination with Scattering Volumes and Object Clusters , 1995, IEEE Trans. Vis. Comput. Graph..