Determining the Separation of Preprocessed Polyhedra - A Unified Approach

We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our emphasis is i) the uniform treatment of polyhedra separation problems, ii) the use of hierarchical representations of primitive objects to provide implicit representations of composite or transformed objects, and iii) applications to natural problems in graphics and robotics.

[1]  G. C. Shephard,et al.  Convex Polytopes , 1967 .

[2]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[3]  David E. Muller,et al.  Finding the Intersection of two Convex Polyhedra , 1978, Theor. Comput. Sci..

[4]  Bernard Chazelle,et al.  Detection is easier than computation (Extended Abstract) , 1980, STOC '80.

[5]  Jacob T. Schwartz,et al.  Finding the Minimum Distance Between Two Convex Polygons , 1981, Information Processing Letters.

[6]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersections , 1982, ICALP.

[7]  Francis Y. L. Chin,et al.  Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons , 1983, IEEE Transactions on Computers.

[8]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..

[9]  Leonidas J. Guibas,et al.  A kinetic framework for computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[10]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[11]  Prof. Dr. Kurt Mehlhorn,et al.  Data Structures and Algorithms 3 , 2012, EATCS Monographs on Theoretical Computer Science.

[12]  Kurt Mehlhorn,et al.  Intersecting two polyhedra one of which is convex , 1985, FCT.

[13]  Herbert Edelsbrunner,et al.  Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.

[14]  Herbert Edelsbrunner,et al.  Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane , 1985, Inf. Process. Lett..

[15]  D. Avis,et al.  Simple On-Line Algorithms for Convex Polygons , 1985 .

[16]  David G. Kirkpatrick,et al.  The geometry of beam tracing , 1985, SCG '85.

[17]  David G. Kirkpatrick,et al.  A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.

[18]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[19]  Bernard Chazelle,et al.  Intersection of convex objects in two and three dimensions , 1987, JACM.

[20]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[21]  David G. Kirkpatrick,et al.  Parallel Construction of Subdivision Hierarchies , 1989, J. Comput. Syst. Sci..

[22]  David P. Dobkin,et al.  Detecting the intersection of convex objects in the plane , 1991, Comput. Aided Geom. Des..

[23]  Bernard Chazelle,et al.  An optimal algorithm for intersecting three-dimensional convex polyhedra , 1989, 30th Annual Symposium on Foundations of Computer Science.