Shortest Paths in 3-Space, Voronoi Diagrams with Barriers, and Related Complexity and Algebraic Issues-Reference-Cited by-同舟云学术

Shortest Paths in 3-Space, Voronoi Diagrams with Barriers, and Related Complexity and Algebraic Issues

Published:1985 Issue: Volume: Page:895-917
ISSN:
Container-title:Fundamental Algorithms for Computer Graphics
language:
Short-container-title:

Author:

Franklin Wm. Randolph,Akman Varol

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-84574-1_39.pdf

Reference41 articles.

1. V. AKMAN, Findminpath algorithms for task—level (model—based) robot programming, Tech. Rep., ECSE Dept., Rensselaer Polytechnic Inst., Troy, NY, March 1984.

2. D. ARNON, G. E. COLLINS AND S. MCCALLUM, Cylindrical algebraic decomposition I: the basic algorithm, SIAM Journal on Computing 13, 4 (Nov. 1984), 865–877.

3. D. ARNON, G. E. COLLINS AND S. MCCALLUM, Cylindrical algebraic decomposition II: an adjacency algorithm for the plane, SIAM Journal on Computing 13, 4 (Nov. 1984), 878–889.

4. R. A. BROOKS, Solving the Find—Path problem by good representation of free space, IEEE Transactions on Systems. Man, and Cybernetics 13, 3 (March/April 1983 ). 190–197.

5. B. M. CHAZELLE, Fast searching in a real algebraic manifold with applications to geometric complexity, Tech. Rep., Computer Science Dept., Brown Univ., Providence, RI, June 1984.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A polynomial time algorithm for an exact encoding of space containing;International Journal of Computer Mathematics;1994-01

2. Geometry and Graphics Applied to Robotics;Theoretical Foundations of Computer Graphics and CAD;1988