SWIFT: Accelerated Proximity Queries Using Multi-Level Voronoi Marching
暂无分享,去创建一个
[1] Nimrod Megiddo,et al. Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[2] N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.
[3] Herbert Edelsbrunner,et al. Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.
[4] S. Sathiya Keerthi,et al. A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..
[5] Eurographics Workshop on Animation and Simulation , 1990 .
[6] David G. Kirkpatrick,et al. Determining the Separation of Preprocessed Polyhedra - A Unified Approach , 1990, ICALP.
[7] Raimund Seidel,et al. Linear programming and convex hulls made easy , 1990, SCG '90.
[8] Stephen Cameron,et al. Approximation hierarchies and S-bounds , 1991, SMA '91.
[9] Ming C. Lin,et al. Efficient collision detection for animation and robotics , 1993 .
[10] Philip M. Hubbard,et al. Interactive collision detection , 1993, Proceedings of 1993 IEEE Research Properties in Virtual Reality Symposium.
[11] David L. Zeltzer,et al. A New Model for Efficient Dynamic Simulation , 1993 .
[12] E. J. Stollnitz,et al. Wavelets for Computer Graphics : A Primer , 1994 .
[13] Sean Quinlan,et al. Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[14] Dinesh Manocha,et al. OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.
[15] David P. Luebke,et al. View-dependent simplification of arbitrary polygonal environments , 1997, SIGGRAPH.
[16] Michael Garland,et al. Surface simplification using quadric error metrics , 1997, SIGGRAPH.
[17] Stephen Cameron,et al. Enhancing GJK: computing minimum and penetration distances between convex polyhedra , 1997, Proceedings of International Conference on Robotics and Automation.
[18] Dinesh Manocha,et al. Appearance-preserving simplification of polygonal models , 1998 .
[19] Brian Mirtich,et al. V-Clip: fast and robust polyhedral collision detection , 1998, TOGS.
[20] Joseph S. B. Mitchell,et al. Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..
[21] Leonidas J. Guibas,et al. H-Walk: hierarchical distance computation for moving convex bodies , 1999, SCG '99.
[22] Leonidas J. Guibas,et al. Separation-sensitive collision detection for convex objects , 1998, SODA '99.
[23] Kok-Lim Low,et al. Computing bounding volume hierarchies using model simplification , 1999, SI3D.
[24] Ming C. Lin,et al. Fast volume-preserving free form deformation using multi-level optimization , 1999, SMA '99.
[25] Ming C. Lin,et al. Accelerated proximity queries between convex polyhedra by multi-level Voronoi marching , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).
[26] H. Ehlers. LECTURERS , 1948, Statistics for Astrophysics.