论文信息 - Fast Detection of Polyhedral Intersections

Fast Detection of Polyhedral Intersections

Methods are given for unifying and extending previous work on detecting polyhedral intersections. The technique of dynamic (vs. static) description is introduced and used to extend previous results. New upper bounds of O(log n) and O(log2n) are given on plane-polyhedron and polyhedron-polyhedron intersection problems.

David G. Kirkpatrick | David P. Dobkin

[1] David P. Dobkin,et al. Efficient Uses of the Past , 1980, FOCS.

[2] Gary S. Watkins,et al. A real time visible surface algorithm , 1970 .

[3] G. Dantzig,et al. Linear Programming and Its Extensions. , 1966 .

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

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

[6] Patrick Henry Winston,et al. The psychology of computer vision , 1976, Pattern Recognit..