Fast detection of polyhedral intersections

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 140 LNCS, Issue , 1982, Pages 154-165

  Dobkin, David P ^a   Kirkpatrick, David G ^b  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

FAST DETECTIONS; INTERSECTION PROBLEM; UPPER BOUND;

GEOMETRY;

EID: 85037037823     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0012765     Document Type: Conference Paper

References (9)

1. B. Chazelle and D. Dobkin, Detection is easier than computation, ACM Symposium on Theory of Computing, Los Angeles, Ca, May, 1980,146-153.
2. G. B. Dantzig, Linear Programrning and its Extensions, Princeton University Press, Princeton, NJ, 1963.
3. D. P. Dobkin and J. I. Munro, Efficient uses of the past, 21st Annual Symposium on Foundations of Computer Science, Syracuse, NY, October, 1980, E00-206.
4. D. G. Kirkpatrick, Optimal search in planar subdivisions, detailed abstract, Univ. of British Columbia, Vancouver, B.C., Canada, 1980.
5. D. Muller and F. Preparata, Finding the intersection of 2 convex polyhedra, Technical Report, University of Illinois, Oct., 1977.
6. M. Shames, Computational Geometry, PhD Thesis, Yale U., May, 1978.
7. J. E. Warnock, A hidden-surface algorithm for computer generated half-tone pictures, University of Utah Computer Science Department, TR 4-15, 1969.
8. G. S. Watkins, A real-time visible surface algorithm, University of Utah Computer Science Department, UTEC-CSc-70-101, June, 1970.
9. P. H. Winston, The Psychology of Computer Vision, McGraw Hill, New York, 1975.