Abstract
Given two intersecting polyhedra P, Q and a direction d, find the smallest translation of Q along d that renders the interiors of P and Q disjoint. The same question can also be asked without specifying the direction, in which case the minimum translation over all directions is sought. These are fundamental problems that arise in robotics and computer vision. We develop techniques for implicitly building and searching convolutions and apply them to derive efficient algorithms for these problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. Agarwal. Ray shooting and other applications of spanning trees with low stabbing number. Proc. of 5th ACM Symposium on Computational Geometry, 315–325, 1989.
A. Aggarwal, L. Guibas, J. Saxe, and P. Shor. A linear time algorithm for computing the Voronoi diagram of a convex polygon. Discrete and Computational Geometry, 4:591–604, 1989.
T. Asano. An efficient algorithm for finding the visibility polygons for a polygonal region with holes. Transactions of IECE of Japan, E-68:557–559, 1985.
J. Bentley and T. A. Ottman. Algorithms for reporting and counting geometric intersections, IEEE Transactions on Computers, C-28:643–647, 1979.
C. E. Buckley and L. J. Leifer. A proximity metric for continuum path planning. Proc. 9th International Joint Conference on Artificial Intelligence, 1096–1102, 1985.
S. A. Cameron and R. K. Culley. Determining the minimum translation distance between two convex polyhedra. Proc. IEEE International Conference on Robotics and Automation, 591–596, 1986.
B. Chazelle. Efficient polygon triangulation. Technical Report, Princeton University, 1990.
D. Dobkin and D. Kirkpatrick. Determining the separation of preprocessed polyhedra—a unified approach. Proc. of ICALP, July 1990.
D. Dobkin, J. Hershberger, D. Kirkpatrick and S. Suri. Implicitly Searching Convolutions and Computing Depth of Collision. Manuscript in preparation, 1990.
H. Edelsbrunner, L. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision. SIAM Journal on Computing, 15:317–340, 1986.
M. Garey, D. S. Johnson, F. P. Preparata and R. E. Tarjan. Triangulating a simple polygon. Information Processing Letters, 7:175–179, 1978.
L. Guibas, M. Overmars, and M. Sharir. Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques. In Proc. of the First Scandinavian Workshop on Algorithm Theory, pages 64–73. Springer-Verlag, 1988. Lecture Notes in Computer Science 318.
L. Guibas, L. Ramshaw and J. Stolfi. A kinetic framework for computational geometry. Proc. 24th Foundations of Computer Science, 100–111, Nov. 1983.
L. J. Guibas and J. Stolfi. Ruler, compass, and computer: The design and analysis of geometric algorithms. Research Report 37, DEC Systems Research Center, 1989. Also appeared in Theoretical Foundations of Computer Graphics and CAD, Springer-Verlag.
S. Hertel and K. Mehlhorn. Fast triangulation of simple polygons. Lecture Notes in Computer Science, 158, 207–218, 1983.
K. Kedem, R. Livne, J. Pack and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete and Computational Geometry, 1:59–72, 1986.
S. S. Keerthi and K. Sridharan. Efficient algorithms for computing two measures of depth of collision between convex polygons. Technical Report, Department of Computer Science and Automation, IIS, Banglore, India, 1989.
D. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal on Computing, 12:28–35, 1983.
T. A. Ottman, P. Widmeyer and D. Wood. A fast algorithm for Boolean mask operations. Inst. f. Angewandte Mathematik und Formale Beschreibungsverfahren, D-7500 Karlsruhe, Report no. 112, 1982.
S. Suri and J. O'Rourke. Worst-case optimal algorithms for constructing visibility polygons with holes. Proc. of 2nd ACM Symposium on Computational Geometry, 14–23, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dobkin, D., Hershberger, J., Kirkpatrick, D., Suri, S. (1990). Implicitly searching convolutions and computing depth of collision. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_66
Download citation
DOI: https://doi.org/10.1007/3-540-52921-7_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52921-7
Online ISBN: 978-3-540-47177-6
eBook Packages: Springer Book Archive