Convex minimization on a grid and applications

Journal of Algorithms

Volumn 26, Issue 2, 1998, Pages 209-237

  Mirolo, Claudio ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; GEOMETRY;

CONVEX FUNCTIONS; CONVEX MINIMIZATION; CONVEX POLYHEDRONS; EFFICIENT COMPUTATION; GRID CELLS; HALF SPACES; ISOTHETIC GRIDS; MINIMIZATION PROBLEMS; MINIMUM POINTS; PROXIMITY MEASURE;

DIRECTED GRAPHS;

EID: 0000739517     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0908     Document Type: Article

References (36)

1. S. Bonner and R. B. Kelley, A novel representation for planning 3-D collision-free paths, IEEE Trans. Syst. Man Cybernetics 20(6) (1990), 1337-1351.
2. S. Cameron and R. K. Culley, Determining the minimum translational distance between two convex polyhedra, in "Proceedings of the IEEE International Conference on Robotics and Automation," 1986, pp. 591-596.
3. S. Cameron and J. Aylett, ROBMOD: A geometric engine for robotics, in "Proceedings of the IEEE International Conference on Robotics and Automation," Philadelphia, 1988, pp. 880-885.
4. S. Cameron, Collision detection by four dimensional intersection testing, IEEE Trans. Robotics Automat. 6(3) (1990), 291-302.
5. J. Canny, Collision detection for moving polyhedra, IEEE Trans. Pattern Anal. Machine Intell. PAMI-8(2) (1986), 200-209.
6. B. Chazelle and D. P. Dobkin, Intersection of convex objects in two and three dimensions, J. ACM 34(1) (1987), 1-27.
7. J. Cohen, M. C. Lin, D. Manocha, and M. Ponamgi, I-Collide: An interactive and exact collision detection system for large-scaled environments, in "Proceedings of the ACM International 3D Graphics Conference," 1995, pp. 189-196.
8. A. P. del Pobil, M. Pérez, and B. Martínez, A practical approach to collision detection between general objects, in "Proceedings of the IEEE International Conference on Robotics and Automation," Minneapolis, 1996, pp. 779-784.
9. D.P. Dobkin and D. G. Kirkpatrick, Fast detection of polyhedral intersection, Theoret. Comput. Sci. 27(3) (1983), 241-253.
10. D. P. Dobkin and D. G. Kirkpatrick, Determining the separation of preprocessed polyhedra - A unified approach, in "Proceedingsof ICALP," Lecture Notes in Computer Science, Vol. 443, pp. 400-413, Springer, Berlin, 1990.
11. D. Dobkin, J. Hershberger, D. Kirkpatrick, and S. Suri, Implicitly searching convolutions and computing depth of collision, in "Proceedings of SIGAL," Lecture Notes in Computer Science, Vol. 450, pp. 165-180, Springer, Berlin, 1990.
12. D. Dobkin, J. Hershberger, D. Kirkpatrick, and S. Suri, Computing the intersection-depth of polyhedra, Algorithmica 9(6) (1993), 518-533.
13. H. Edelsbrunner, L. J. Guibas, and J. Stolfi, Optimal point location in a monotone subdivision, SIAM J. Comput. 15 (1986), 317-340.
14. H. Edelsbrunner, "Algorithmsin Combinatorial Geometry," Springer, Berlin, 1987.
15. E. G. Gilbert, D. W. Johnson, and S. S. Keerthi, A fast procedure for computing the distance between complex objects in three-dimensional space, IEEE J. Robotics Automat. 4(1) (1988), 193-203.
16. E. G. Gilbert and C. P. Foo, Computing the distance between general convex objects in three-dimensional space, IEEE Trans. Robotics Automat. 6(1) (1990), 53-61.
17. E. G. Gilbert and C. J. Ong, New distances for the separation and penetration of objects, in "Proceedings of the IEEE International Conference on Robotics and Automation," San Diego, 1994, pp. 579-585.
18. O. Günther and E. Wong, A dual approach to detect polyhedral intersections in arbitrary dimensions, Bit 31(1) (1991), 2-14.
19. J. E. Hopcroft, J. T. Schwartz, and M. Sharir, Efficient detection of intersection among spheres, Int. J. Robotics Res. 2(4) (1983), 77-80.
20. P. Jiménez and C. Torras, Speeding up interference detection between polyhedra, in "Proceedings of the IEEE International Conference on Robotics and Automation," Minneapolis, 1996, pp. 1485-1492.
21. M. C. Lin and J. Canny, A fast algorithm for incremental distance calculation, in "Proceedings of the IEEE International Conference on Robotics and Automation," Sacramento, 1991, pp. 1008-1014.
22. M. C. Lin, D. Manocha, and J. Canny, Fast contact determination in dynamic environments, in "Proceedings of the IEEE International Conference on Robotics and Automation," San Diego, 1994, pp. 602-608.
23. M. C. Lin, D. Manocha, and M. Ponamgi, Fast algorithms for penetration and contact determination between non-convex polyhedral models, in "Proceedings of the IEEE International Conference on Robotics and Automation," Nagoya, Japan, 1995, pp. 2707-2712.
24. C. Mirolo and E. Pagello, A solid modeling system for robot action planning, IEEE Comput. Graphics Appl. 9(1) (1989), pp. 55-69.
25. C. Mirolo, "Geometric Algorithms for Detecting Collisions between Convex Polyhedra," Report UDMI/01/91/RR, Dip. di Matematica e Informatica dell'Univ. di Udine, 1991.
26. C. Mirolo, "Polylogarithmic Algorithms for Collision Detection Based on Convex Minimization," Report UDMI/01/94/RR, Dip. di Matematica e Informatica dell'Univ. di Udine, 1994.
27. C. Mirolo and E. Pagello, A practical motion planning strategy based on a plane-sweep approach, in "Proceedings of the IEEE International Conference on Robotics and Automation," Albuquerque, 1997.
28. A. S. Nemirovsky and D. B. Yudin, "Problem Complexity and Method Efficiency in Optimization," Wiley, New York, 1983.
29. C. J. Ong, Properties of penetration between general objects, in "Proceedings of the IEEE International Conference on Robotics and Automation," Nagoya, Japan, 1995, pp. 2293-2298.
30. S. Quinlan, Efficient distance computation between non-convex objects, in "Proceedings of the IEEE International Conference on Robotics and Automation," San Diego, 1994, pp. 3324-3329.
31. N. K. Sancheti and S. S. Keerthi, Computation of certain measures of proximity between convex polytopes A complexity viewpoint, in "Proceedings of the IEEE International Conference on Robotics and Automation," Nice, France, 1992, pp. 2508-2513.
32. Y. Sato, M. Hirata, T. Maruyama, and Y. Arita, Efficient collision detection using fast distance-calculation algorithmsfor convex and non-convex objects, in "Proceedings of the IEEE International Conference on Robotics and Automation," Minneapolis, 1996, pp. 771-778.
33. H. Six and D. Wood, Counting and reporting intersections of d-ranges, IEEE Trans. Comput. C-31(3) (1982), 45-55.
34. K. Sridharan, H. E. Stephanou, and S. S. Keerthi, On computing a distance measure for path planning, in "Proceedingsof the IEEE International Conference on Robotics and Automation," Atlanta, 1993, pp. 554-559.
35. K. Sridharan and H. E. Stephanou, Algorithms for rapid computation of some distance functions between objects for path planning, in "Proceedings of the IEEE International Conference on Robotics and Automation," San Diego, 1994, pp. 967-972.
36. F. Thomasand C. Torras, Interference detection between non-convex polyhedra revisited with a practical aim, in "Proceedings of the IEEE International Conference on Robotics and Automation," San Diego, 1994, pp. 587-594.