Abstract
We treat one of the many geometrical problems that face him who simulates tasks for industrial robot manipulators: given two convex objects (in 2 or 3 dimensions), determine whether they intersect. Our iterative algorithm will either find a wedge which contains all of one object but nothing of the other or find a point which belongs to both objects or say it cannot tell. The last alternative occurs only if the objects are not more than (a given) ɛ apart. The wedge or the common point, respectively, can be found iteratively by constructing touching-lines (touching-planes, in space) from a point on one object to the other object. This geometrical idea at the base of the algorithm is new.
Similar content being viewed by others
References
Arnon, D.S., Mignotte, S.F., (1988). On mechanical quantifier elimination for elementary algebra and geometry; Journ. of Symbolic Computation, vol. 5, no. 2, pp. 237–260.
Boyse, J.W., (1979). Interference detection among solids and surfaces; Comm. ACM, vol. 22/1, pp. 3–9.
Freund, E., Hoyer, H., (1985). A method for automatic collision avoidance for robots (German); Robotersysteme, vol. 1, pp. 67–73.
Kahan, W., (1975). An ellipse problem; ACM SIGSAM Bulletin, vol. 9/3, p. 11.
Roider, B., Stifter, S., (1987). Collision of convex objects; Techn. Rep. RISC-87-2.0, Univ. Linz, Dept. of Mathematics.
Stifter, S., Roider, B., (1987). Collision of convex objects in the plane; Proc. 10th Tagung Berichte aus Informatikinstituten, Vienna, Austria, Oldenburg Verlag, pp. 359–368.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roider, B., Stifter, S. (1989). Collision of convex objects. In: Davenport, J.H. (eds) Eurocal '87. EUROCAL 1987. Lecture Notes in Computer Science, vol 378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51517-8_124
Download citation
DOI: https://doi.org/10.1007/3-540-51517-8_124
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51517-3
Online ISBN: 978-3-540-48207-9
eBook Packages: Springer Book Archive