Abstract
The path existence problem and the collision detection problem for time-varying objects in a geometric scene are discussed. For a large class of spherical nonrigid objects, exact solutions of the path existence problem are developed based on decomposition techniques and graph traversal.
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
Abramowski S, Müller H (1988) Collision Avoidance for Nonrigid Objects to appear in Zeitschrift für Operations Research (ZOR)
Badler N I, Smoliar S W (1979) Digital Representation of Human Movement. ACM Computing Surveys 11: 19–38
Bentley J L, Ottmann T (1979) Algorithms for Reporting and Counting Geometric Intersections. IEEE Transactions on Computers 28: 643–647
Blume C, Jakob W (1983) Programming Languages for Industrial Manipulators (in German). Vogel-Verlag Würzburg
Brooks R A (1983) Solving the find-Path Problem by Good Representation of Free Space. IEEE Transactions on Systems, Man And Cybernetics: 190–197
Brooks R A, Lozano-Perez T (1983) A Subdivision Algorithm in Configuration Space for Findpath with Rotation. IJCAI: 799–806
Chazelle B (1985) Fast Searching in a Real Algebraic Manifold with Applications to geographic complexity. CAAP'85: 145–156
Hopcroft J, Joseph D, Whitesides S (1984) Movement Problems for 2-dimensional Linkages. SIAM Journal on Computing 13: 610–629
Hopcroft J, Joseph D, Whitesides S (1985) On the Movement of Robot Arms in 2-dimensional bounded Regions. SIAM Journal on Computing 14: 315–333
Kedem K, Sharir M (1985) An Efficient Algorithm for Planing Collisionfree Translational Motion of a Convex Polygonal Object in 2-dimensional Scene Amidst Polygonal Obstacles. 1. ACM Symposium on Computational Geometry: 75–80
Lozano-Perez T, Wesley M A (1979) An Algorithm for Planning Collision-Free Paths Among Polyhedral Obstacles. CACM 22: 560–570
Magnenat-Thalmann N, Thalmann D (1985) Computer Animation: Theory and Practice. Springer-Verlag Berlin
Mehlhorn K (1984) Data Structures and Algorithms III. Springer-Verlag Berlin
O'Dunlaing C, Sharir M, Yap C K (1983) Retraction: A New Approach to Motion-Planning. ACM Symposium on the Theory of Computing: 207–220
Reif J H (1979) Complexity of the Mover's Problem and Generalizations. IEEE FOCS: 421–427
Schwartz J T, Sharir M (1983) On the Piano Movers Problem. II. General Techniques for Computing Topological Properties of Real Algebraic Manifolds. Advances in applied Mathematics 4: 298–351
Sharir M, Schorr A (1984) On Shortest Paths in Polyhedral Spaces. ACM STOC: 144–153
Wu Y F, Widmayer P, Schlag M D F, Wong C K (1985) Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles. IBM Research Report RC 11039(#49019)1/4/85
Yao A C, Yao F F (1985) A General Approach to d-dimensional geometric queries. ACM STOC: 163–168
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abramowski, S. (1988). Collision avoidance for nonrigid objects. In: Noltemeier, H. (eds) Computational Geometry and its Applications. CG 1988. Lecture Notes in Computer Science, vol 333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50335-8_33
Download citation
DOI: https://doi.org/10.1007/3-540-50335-8_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50335-4
Online ISBN: 978-3-540-45975-0
eBook Packages: Springer Book Archive