Advertisement

Computational geometry: Selected algorithms and paradigms

  • Th. Ottmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 203)

Abstract

Computational geometry is a fascinating and rich area of current research. Our aim was first to give the reader an impression of the kind of problems studied in this field and a feeling for some application areas where these problems arise. Furthermore a few selected algorithms and data structures have been presented: Geometric divide and conquer, the scan-line paradigm and the zigzag paradigm are certainly already classic examples of algorithmic techniques. Moreover, range trees, segment and interval trees, and priority search trees belong to the very basic structures which everyone working in the field should know. Many more algorithmic techniques and clever data structures have been invented. It is not easy to structure the hundreds of isolated algorithmic solutions of geometric problems and to filter out the underlying principles and structures of paradigmatic character. Nevertheless we have no doubt that a considerable fraction of the ideas emerged in this area will quite soon become an integral part of any computer science curriculum.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. [BW]
    Bentley, J.L., and Wood, D.: An Optimal Worst Case Algortihm for Reporting Intersections of Rectangles, IEEE Transactions on Computers C-29, 1980, 563–580Google Scholar
  2. [E]
    Edelsbrunner, H.: Dynamic Data Structures for Orthogonal Intersection queries, IIG, Technische Univ. Graz, Austria, Rep. 59, Oct. 1980Google Scholar
  3. [EvL]
    Edelsbrunner, H., and van Leeuwen, J.: Multidimensional data structures and algorithms, A bibliography, IIG, Technische Univ. Graz, Rep. 104, 1983Google Scholar
  4. [GS]
    Güting, R.H., and Schilling W.: A Practical Divide-and-Conquer Algorithm for the Rectangle Intersection Problem, Forschungsbericht 196, 1985, Universität DortmundGoogle Scholar
  5. [GW]
    Güting, R.H., and Wood, D.: Finding Rectangle Intersections by divide-and-conquer, IEEE Transactions on Computers C-33, 1984, 671–675Google Scholar
  6. [McC1]
    McCreight, E.M.: Efficient Algorithms for Enumerating Intersecting Intervals and Rectangles, Xerox Palo Alto Res. Ctr., Palo Alto, CA, Techn. Report. PARC CSL-80-9, 1980Google Scholar
  7. [McC2]
    McCreight, E.M.: Priority Search Trees, Xerox Palo Alto Res. Ctr., Palo Alto, CA, Techn. Report PARC CSL-80-5, 1981Google Scholar
  8. [Me]
    Mehlhorn, K.: Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry, Springer Verlag, N.Y., 1984Google Scholar
  9. [LP]
    Lee, D.T. and Preparata, F.P.: Computational Geometry — A Survey, IEEE Transactions on Computers, vol. c-33, no 12, 1984, 1072–1101Google Scholar
  10. [PS]
    Preparata, F.P., and Shamos, M.I.: Computational Geometry, Springer Verlag, N.Y., 1985Google Scholar
  11. [Sh]
    Shamos, M.I.: Computational Geometry, Ph. D. Dissertation, Yale University, 1978Google Scholar
  12. [SSW]
    Soisalon-Soininen, E., and Wood, D.: An Optimal Algorithm to Compute the Closure of a Set of Iso-Rectangles, J. Algorith., vol. 5, no 2, pp. 199–214, June 1984CrossRefGoogle Scholar
  13. [To]
    Toussaint, G. (Ed.): Computational Geometry, Elsevier North Holland, N.Y., 1985Google Scholar
  14. [Wo]
    Wood, D.: An Isothetic View of Computational Geometry, Comp. Sc. Techn. Report CS-84-01, Jan. 1984, Univ. of WaterlooGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Th. Ottmann
    • 1
  1. 1.Institut für Angewandte Informatik und Formale BeschreibungsverfahrenUniversität KarlsruheKarlsruhe

Personalised recommendations