Computing the intersection-depth of polyhedra
暂无分享,去创建一个
David G. Kirkpatrick | David P. Dobkin | Subhash Suri | John Hershberger | D. Dobkin | S. Suri | J. Hershberger | D. Kirkpatrick
[1] Leonidas J. Guibas,et al. A linear-time algorithm for computing the voronoi diagram of a convex polygon , 1989, Discret. Comput. Geom..
[2] David G. Kirkpatrick,et al. Determining the Separation of Preprocessed Polyhedra - A Unified Approach , 1990, ICALP.
[3] Herbert Edelsbrunner,et al. Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.
[4] Joseph O'Rourke,et al. Worst-case optimal algorithms for constructing visibility polygons with holes , 1986, SCG '86.
[5] Brenda S. Baker,et al. Polygon Containment under Translation , 1986, J. Algorithms.
[6] Bernard Chazelle,et al. Intersection of convex objects in two and three dimensions , 1987, JACM.
[7] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.
[8] Bernard Chazelle,et al. Triangulating a simple polygon in linear time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[9] G. C. Shephard,et al. Convex Polytopes , 1969, The Mathematical Gazette.
[10] Leonidas J. Guibas,et al. Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques , 1988, SWAT.
[11] David G. Kirkpatrick,et al. Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..
[12] David G. Kirkpatrick,et al. A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.
[13] David G. Kirkpatrick,et al. Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..
[14] Kurt Mehlhorn,et al. Fast Triangulation of Simple Polygons , 1983, FCT.
[15] Larry J. Leifer,et al. A Proximity Metric for Continuum Path Planning , 1985, IJCAI.
[16] David Avis,et al. A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.
[17] S. A. Cameron,et al. Determining the minimum translational distance between two convex polyhedra , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[18] Micha Sharir,et al. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..
[19] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[20] Leonidas J. Guibas,et al. A kinetic framework for computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[21] Kurt Mehlhorn,et al. Multi-dimensional searching and computational geometry , 1984 .
[22] Pankaj K. Agarwal,et al. Ray shooting and other applications of spanning trees with low stabbing number , 1992, SCG '89.
[23] David G. Kirkpatrick,et al. Fast Detection of Polyhedral Intersections , 1982, ICALP.
[24] Francis Y. L. Chin,et al. Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons , 1983, IEEE Transactions on Computers.
[25] Leonidas J. Guibas,et al. Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..
[26] T. Asano. An Efficient Algorithm for Finding the Visibility Polygon for a Polygonal Region with Holes , 1985 .
[27] Robert E. Tarjan,et al. Triangulating a Simple Polygon , 1978, Inf. Process. Lett..
[28] Leonidas J. Guibas,et al. An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body , 1988, J. Algorithms.
[29] Leonidas J. Guibas,et al. The Design and Analysis of Geometric Algorithms , 1994, IFIP Congress.