A polynomial time algorithm for an exact encoding of space containing

References

• Edelsbrunner , Herbert . 1987 . Algorithms in Combinatorial Geometry , Springer-Verlag .
   Google Scholar
• Yap , C. K. and Schwartz , J. T. 1987 . Advances in Robotics Algorithmic and Geometric Aspects of Robotics , Vol. 1 , LEA .
   Google Scholar
• Akman , Varol . 1987 . Unobstructed Shortest Paths in Polyhedral Environments , Springer-Verlag .
   Google Scholar
• Sharir , M. and Schorr , A. 1987 . On Shortest Paths in Polyhedral Spaces . Proc. 16th AMC Symp , : 144 – 153 .
   Google Scholar
• Schwartz , J. T. and Sharir , M. 1983a . On the Piano Movers′ Problem: The Special Case of a Rigid Polynomial Body Moving Amidst Polygonal Barriers . Advances in Appl. Math , : 345 – 398 .
   Google Scholar
• Preparata , F. P. and Shamos , M. I. 1988 . Computational Geometry , Springer-Verlag .
   Google Scholar
• Leven , D. and Sharir , M. 1985 . An Efficient and Simple Motion Planning Algorithm for a Ladder Moving in Two-Dimensional Space Amidst Polygonal Barriers (extended abstract . I ACM Symp. on Computational Geometry , : 221 – 227 .
   Google Scholar
• Chew , L. P. 1985 . Planning the Shortest Path for a Disc in 0(n2-logn) Time . Proc. I ACM Symp. on Computational Geometry , : 214 – 220 .
   Google Scholar
• Franklin , W. R and Akman , V. 1985 . Euclidian Shortest Paths in 3-space, Voronoi Diagrams with Barriers, and Algebraic Issues . Fundamental Algorithms for Computer Graphic , : 895 – 917 .
   Google Scholar
• Orourke , J. , Suri , S. and Booth , H. 1985 . Shortest Paths of Polyhedral Surfaces. Proc . Proc.2nd Annual Symp. on Theoretical Aspects of Computer Science , : 243 – 254 .
   Google Scholar
• Mitchell , J. S. B. , Mount , D. M. and Papadimitrou , C. H. 1985 . “ The Discrete Geodesic Problem. Operation Research Dept ” . Stanford, CA : Stanford Univ. .
   Google Scholar
• Reif , J. H. and Storer , J. A. “ Shortest Paths in Euclidian Space with Polyhedral Obstacles, Tech. Rep ” .
   Google Scholar