Precision-Sensitive Euclidean Shortest Path in 3-Space
暂无分享,去创建一个
[1] Leslie G. Valiant,et al. NP is as easy as detecting unique solutions , 1985, STOC '85.
[2] Micha Sharir,et al. On Shortest Paths in Polyhedral Spaces , 1986, SIAM J. Comput..
[3] Marshall W. Bern,et al. Hidden surface removal for rectangles , 1988, SCG '88.
[4] John F. Canny,et al. New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[5] Micha Sharir,et al. On shortest paths in polyhedral spaces , 1986, STOC '84.
[6] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[7] Christos H. Papadimitriou,et al. An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..
[8] James Renegar. On the computational complexity and geome-try of the first-order theory of the reals , 1992 .
[9] Allen A. Goldstein,et al. Constructive Real Analysis , 1967 .
[10] J. H. Wilkinson. The algebraic eigenvalue problem , 1966 .
[11] Johannes Blömer,et al. Computing Sums of Radicals in Polynomial Time , 1991, FOCS.
[12] Mark de Berg,et al. Efficient algorithms for ray shooting and hidden surface removal , 1992 .
[13] Johannes Blömer,et al. Simplifying expressions involving radicals , 1992 .
[14] Chee-Keng Yap,et al. Towards Exact Geometric Computation , 1997, Comput. Geom..
[15] Chee-Keng Yap,et al. Approximate Euclidean shortest path in 3-space , 1994, SCG '94.
[16] Subhash Suri,et al. Efficient computation of Euclidean shortest paths in the plane , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[17] J. Renegar,et al. On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .