Tiow-Seng Tan
- Arvo90.J. Arvo and D. Kirk. A Survey of Ray Tracing Acceleration Techniques. In An Introduction to Ray Tracing, A.S. Glassner, ed., 201----262, Academic Press, 1990. Google Scholar
Digital Library
- Barequet96.G. Barequet, B. Chazelle, L. Guibas, J. Mitchell and A. Tal. BOXTREE: A Hierarchical Representation for Surfaces in 3D. Proceedings Eurographics'96, Vol. 15(3), C- 387--396, C-484, August 1996.Google ScholarCross Ref
- Beckmann90.N. Beekmann, H. Kriegel, R. Schneider and B. Seeger. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. Proceedings ACM SIGMOD International Conference on Management of Data, 322~331, 1990. Google ScholarDigital Library
- Bergen98.G. van den Bergen. Efficient Collision Detection of Complex Deformable Models using AABB Trees. To appear in Journal of Graphics Tools (http://www.win.tue.nl/cs/tt/gino/solid). Google ScholarDigital Library
- Cohen98.J. Cohen, M. Olano and D. Manocha. Appearance- Preserving Simplification. Computer Graphics (SIGGRAPH'98 Proceedings), 115---122, July 1998. Google ScholarDigital Library
- Edelsbrunner94.H. Edelsbrunner and E. M0cke. Three- Dimensional Alpha Shapes. ACM Transactions on Graphics, Vol. 13(1), 43--72, January 1994. Google ScholarDigital Library
- Faverjon89.B. Faverjon. Hierarchical Object Models for Efficient Anti-collision Algorithms. Proceedings IEEE International Conference on Robotics and Automation, 333-- 340, 1989.Google ScholarCross Ref
- Garcia94.A. Garcia-Alonso, N. Serrano and J. Flaquer. Solving the Collision Detection Problem. IEEE Computer Graphics & Applications, Vol. 14, 36----43, May 1994. Google ScholarDigital Library
- Garland97.M. Garland and P. Heckbert. Surface Simplification Using Quadric Error Metrics. Computer Graphics (SIGGRAPH'97 Proceedings), 209---216, August 1997. Google ScholarDigital Library
- Gottschalk96.S. Gottschalk, M.C. Lin and D. Manocha. OBBTree: A Hierarchical Structure for Rapid Interference Detection. Computer Graphics (SIGGRAPH'96 Proceedings), 171--179, 1996. Google ScholarDigital Library
- Goldsmith87.J. Goldsmith and J. Salmon. Automatic Creation of Object Hierarchies for Ray Tracing. IEEE Computer Graphics & Applications, 14---20, 1987. Google ScholarDigital Library
- Heckbert97.P. Heckbert and M. Garland. Survey of Polygonal Surface Simplification Algorithms. School of Computer Science, CMU, Pittsburgh, May 1997, http://www.cs.cmu.edu/-~ph.Google Scholar
- Held95.M. Held, J. Klosowski and J. Mitchell. Evaluation of Collision Detection Methods for Virtual Reality Fly-throughs. Proceedings 7th Canad. Conf. Computational Geometry, 205---210, 1995.Google Scholar
- Hoppe97.H. Hoppe. View-Dependent Refinement of Progressive Meshes. Computer Graphics (SIGGRAPH'97 Proceedings), 189---198, August 1997. Google ScholarDigital Library
- Hubbard96.P. Hubbard. Approximating Polyhedra with Spheres for Time-critical Collision Detection. ACM Trans. Computer Graphics, Vol. 15(3), 179---210, July 1996. Google ScholarDigital Library
- Kay86.T. Kay and J. Kajiya. Ray Tracing Complex Scenes. Computer Graphics (SIGGRAPH'86 Proceedings), 269---278, 1986. Google ScholarDigital Library
- Klimaszewski97.K. Klimaszewski and T. Sederberg. Faster Ray Tracing Using Adaptive Grids. IEEE Computer Graphics & Applications, Vol. 17(i), 42~51, 1997. Google ScholarDigital Library
- Klosowski98.J. Klosowski, M. Held, J. Mitchell, H. Sowizral and K. Zikan. Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs. IEEE Transactions on Visualization and Computer Graphics, Vol. 4(1), 21--36, 1998. Google ScholarDigital Library
- Low97.K-L. Low and T.S. Tan. Model Simplification Using Vertex-Clustering. Proceedings of 1997 Symposium on Interactive 3 D Graphics, 75-----8 I, April 1997. Google ScholarDigital Library
- Luebke97.D. Luebke and C. Erikson. View-Dependent Simplification of Arbitrary Polygonal Environments. Computer Graphics (SIGGRAPH'97 Proceedings), 199---208, August 1997. Google ScholarDigital Library
- Moore88.M. Moore and J. Wilhelms. Collision Detection and Response for Computer Animation. Computer Graphics (SIGGRAPH'88 Proceedings), 289---298, August 1988. Google ScholarDigital Library
- Naylor90.B. Naylor, J. Amatodes and W. Thibault. Merging BSP Trees Yields Polyhedral Set Operations. Computer Graphics (SIGGRAPH'90 Proceedings), 115---124, August 1990. Google ScholarDigital Library
- Noborio89.H. Noborio, S. Fukuda and S. Arimoto. Fast Interference Check Method using Octree Representation. Advanced Robotics, Vol. 3, 193---212, 1989.Google ScholarCross Ref
- Palmer95.I. Palmer and R. Grimsdale. Collision Detection for Animation using Sphere-trees. Computer Graphics Forum, Vol. 14(2), 105---116, June 1995.Google ScholarCross Ref
- Popovic97.J. Popovic and H. Hoppe. Progressive Simplicial Complexes. Computer Graphics (SIGGRAPH'97 Proceedings), 217~224, August 1997. Google ScholarDigital Library
- Rossignac93.J. Rossignac and P. Borrel. Multi-Resolution 3D Approximations for Rendering Complex Scenes. In Modeling in Computer Graphics, B. Falcidieno and T. Kunii, Eds., Springer-Verlag, 1993, 455-----465.Google Scholar
- Sheehy96.D. J. Sheehy, C. G. Armstrong and D. J. Robinson. Shape Description by Medial Surface Construction. IEEE Transactions on Visualization & Computer Graphics, Vol. 2(1 ), 62m72, March 1996. Google ScholarDigital Library
Index Terms
- Computing bounding volume hierarchies using model simplification
Recommendations
GPU Ray Tracing Based on Reduced Bounding Volume Hierarchies
CGIV '12: Proceedings of the 2012 Ninth International Conference on Computer Graphics, Imaging and VisualizationWe present a bounding volume hierarchy construction based on a culling technique for performing ray tracing on manycore GPUs. The objects are divided into view-sets of triangles with respect to a set of view targets (including the camera and the light ...
Ray Specialized Contraction on Bounding Volume Hierarchies
In this paper we propose a simple but effective method to modify a BVH based on ray distribution for improved ray tracing performance. Our method starts with an initial BVH generated by any state-of-the-art offline algorithm. Then by traversing a small ...
Dual Contouring with Topology-Preserving Simplification Using Enhanced Cell Representation
VIS '04: Proceedings of the conference on Visualization '04We present a fast, topology-preserving approach for isosurface simplification. The underlying concept behind our approach is to preserve the disconnected surface components in cells during isosurface simplification. We represent isosurface components in ...
Comments