Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1982: Automata, Languages and Programming pp 154–165Cite as

Fast detection of polyhedral intersections

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 140))

Abstract

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.

This research supported in part by the National Science Foundation under Grant MCS81-14207.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. G. B. Dantzig, Linear Programming and its Extensions, Princeton University Press, Princeton, NJ, 1963.

    MATH  Google Scholar 

  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, 200–206.

    Google Scholar 

  4. D. G. Kirkpatrick, Optimal search in planar subdivisions, detailed abstract, Univ. of British Columbia, Vancouver, B.C., Canada, 1980.

    Google Scholar 

  5. D. Muller and F. Preparata, Finding the intersection of 2 convex polyhedra, Technical Report, University of Illinois, Oct., 1977.

    Google Scholar 

  6. M. Shamos, Computational Geometry, PhD Thesis, Yale U., May, 1978.

    Google Scholar 

  7. 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 

  8. G. S. Watkins, A real-time visible surface algorithm, University of Utah Computer Science Department, UTEC-CSc-70-101, June, 1970.

    Google Scholar 

  9. P. H. Winston, The Psychology of Computer Vision, McGraw Hill, New York, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical Engineering and Computer Science Department, Princeton University, 08540, Princeton, NJ, USA

    David P. Dobkin

  2. Department of Computer Science, University of British Columbia, Vancouver, British Columbia, Canada

    David G. Kirkpatrick

Authors
  1. David P. Dobkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David G. Kirkpatrick
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dobkin, D.P., Kirkpatrick, D.G. (1982). Fast detection of polyhedral intersections. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012765

Download citation

  • DOI: https://doi.org/10.1007/BFb0012765

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11576-2

  • Online ISBN: 978-3-540-39308-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation