| Sato, Y., Hirata M., Maruyama T., Arita Y., "Efficient Collision Detection using Fast Distance Calculation: Algorithms for Convex and Non-Convex Objects," in Proceedings of the 1996 IEEE International Conference on Robotics and Automation, April, 1996, pp. 771-778. |
.... search of the bounding hierarchy [14] Johnson generalized it to other surface representations, including NURBS, by using a breadth first search [9] Sato combined convex tracking at a distance with Quinlan s concave algorithm for near contact to create a general collision detection system [15]. He stored the closest pair of triangles for a number of time steps and used the distance between that pair as a way to quickly approximate the minimum distance. Snyder used time coherence to track penetration depth on spline models in a modeling system [16] Numerical methods quickly updated ....
Sato, Yuichi et al. "Efficient Collision Detection Using Fast Distance-Calculation Algorithms For Convex And Non-Convex Objects", in Proceedings of the 1996 IEEE International Conference on Robotics And Automation. Minneapolis, Minn. April, 1996. pp. 771-778.
....approxi mate results ( relative error ) speeds convergence and demonstrates log(N) scalability, where N is the number of FIGURE 1. The minimum distance between models. 2 polygons in the scene. When exact distance is required, however, the log(N) complexity no longer holds. Sato et al. [26] created a collision detection method for arbitrary polyhedra by combining Quinlan s sphere tree method and Gilbert s convex method. 2.2 Minimum Distance for Parametric Models Existing methods for solving minimum distance queries for sculptured models lose much of the geometric flavor of ....
Sato, Yuichi et al. "Efficient Collision Detection Using Fast Distance-Calculation Algorithms For Convex And Non-Convex Objects", in Proceedings of the 1996 IEEE International Conference on Robotics And Automation. Minneapolis, Minn, April, 1996. pp. 771-778.
No context found.
Sato, Y., Hirata M., Maruyama T., Arita Y., "Efficient Collision Detection using Fast Distance Calculation: Algorithms for Convex and Non-Convex Objects," in Proceedings of the 1996 IEEE International Conference on Robotics and Automation, April, 1996, pp. 771-778.
No context found.
Sato, Y., Hirata M., Maruyama T., Arita Y., "Efficient Collision Detection using Fast Distance Calculation: Algorithms for Convex and Non-Convex Objects," in Proceedings of the 1996 IEEE International Conference on Robotics and Automation, April, 1996, pp. 771-778.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC