Neural Network in Fixed Time for Collision Detection between Two Convex Polyhedra
暂无分享,去创建一个
M. Mestari | N. Saber | M. Khouil | M. Khouil | N. Saber | M. Mestari
[1] A. Namir,et al. AOSNET: a neural network implementation of adjustable order statistic filters in fixed time , 2000 .
[2] D. T. Lee,et al. Computational Geometry—A Survey , 1984, IEEE Transactions on Computers.
[3] Herbert Edelsbrunner,et al. Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.
[4] Elmer G. Gilbert,et al. Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..
[5] Teuvo Kohonen,et al. Correlation Matrix Memories , 1972, IEEE Transactions on Computers.
[6] Jacob T. Schwartz,et al. Finding the Minimum Distance Between Two Convex Polygons , 1981, Information Processing Letters.
[7] Kunihiko Fukushima,et al. A neural network for visual pattern recognition , 1988, Computer.
[8] Francis Y. L. Chin,et al. Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons , 1983, IEEE Transactions on Computers.
[9] David G. Kirkpatrick,et al. A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.