Determining the minimum translational distance between two convex polyhedra
暂无分享,去创建一个
[1] Paul G. Comba,et al. A Procedure for Detecting Intersections of Three-Dimensional Objects , 1968, JACM.
[2] Bruce G. Baumgart,et al. Geometric modeling for computer vision. , 1974 .
[3] David E. Muller,et al. Finding the Intersection of two Convex Polyhedra , 1978, Theor. Comput. Sci..
[4] John W. Boyse,et al. Interference detection among solids and surfaces , 1979, CACM.
[5] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[6] Jacob T. Schwartz,et al. Finding the Minimum Distance Between Two Convex Polygons , 1981, Information Processing Letters.
[7] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[8] Stephen Alan Cameron,et al. Modelling solids in motion , 1984 .
[9] Robert B. Tilove. A null-object detection algorithm for constructive solid geometry , 1984, CACM.
[10] David G. Kirkpatrick,et al. A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.
[11] Larry J. Leifer,et al. A Proximity Metric for Continuum Path Planning , 1985, IJCAI.
[12] Karl G. Kempf,et al. A collision detection algorithm based on velocity and distance bounds , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.