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.
KeywordsHierarchical Description Polyhedral Intersection Outer Representation Dimensional Ease
Unable to display preview. Download preview PDF.
- [CD]B. Chazelle and D. Dobkin, Detection is easier than computation, ACM Symposium on Theory of Computing, Los Angeles, Ca, May, 1980, 146–153.Google Scholar
- [DM]D. P. Dobkin and J. I. Munro, Efficient uses of the past, 21st Annual Symposium on Foundations of Computer Science, Syracuse, NY, October, 1980, 200–206.Google Scholar
- [K]D. G. Kirkpatrick, Optimal search in planar subdivisions, detailed abstract, Univ. of British Columbia, Vancouver, B.C., Canada, 1980.Google Scholar
- [MP]D. Muller and F. Preparata, Finding the intersection of 2 convex polyhedra, Technical Report, University of Illinois, Oct., 1977.Google Scholar
- [Sh]M. Shamos, Computational Geometry, PhD Thesis, Yale U., May, 1978.Google Scholar
- [War]J. E. Warnock, A hidden-surface algorithm for computer generated half-tone pictures, University of Utah Computer Science Department, TR 4–15, 1969.Google Scholar
- [Wat]G. S. Watkins, A real-time visible surface algorithm, University of Utah Computer Science Department, UTEC-CSc-70-101, June, 1970.Google Scholar
- [Wi]P. H. Winston, The Psychology of Computer Vision, McGraw Hill, New York, 1975.Google Scholar