Smallest Enclosing Cylinders
暂无分享,去创建一个
[1] Micha Sharir,et al. Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions , 1997, SODA '97.
[2] M. Streng,et al. Note on the computational complexity ofj-radii of polytopes in ℝn , 1996, Math. Program..
[3] E. Schömer,et al. Efficient collision detection for moving polyhedra , 1995, SCG '95.
[4] Nancy M. Amato,et al. Parallel algorithms for higher-dimensional convex hulls , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[5] P. Agarwal,et al. On range searching with semialgebraic sets , 1994, Discret. Comput. Geom..
[6] Bernard Chazelle,et al. An optimal convex hull algorithm in any fixed dimension , 1993, Discret. Comput. Geom..
[7] Peter Gritzmann,et al. Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spaces , 1993, Math. Program..
[8] Sivan Toledo,et al. Applications of parametric searching in geometric optimization , 1992, SODA '92.
[9] John Canny,et al. The complexity of robot motion planning , 1988 .
[10] Andrew Chi-Chih Yao,et al. A general approach to d-dimensional geometric queries , 1985, STOC '85.
[11] Nimrod Megiddo,et al. Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[12] Nicholas Baron,et al. AMERICAN SOCIETY OF MECHANICAL ENGINEERS , 1880, Science.
[13] William H. Press,et al. Numerical recipes in C , 2002 .
[14] Frank Follert,et al. Maxmin location of an anchored ray in 3-space and related problems , 1995, CCCG.
[15] Elmar Schömer,et al. Subquadratic algorithms for the weighted maximin facility location problem , 1995, CCCG.
[16] Mark H. Overmars,et al. On a Class of O(n2) Problems in Computational Geometry , 1995, Comput. Geom..
[17] C. Yap. Exact computational geometry and tolerancing metrology , 1994 .
[18] J. Renegar. Recent Progress on the Complexity of the Decision Problem for the Reals , 1990, Discrete and Computational Geometry.