Key-problems and key-methods in computational geometry

  • Herbert Edelsbrunner
Invited Lectures

DOI: 10.1007/3-540-12920-0_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 166)
Cite this paper as:
Edelsbrunner H. (1984) Key-problems and key-methods in computational geometry. In: Fontet M., Mehlhorn K. (eds) STACS 84. STACS 1984. Lecture Notes in Computer Science, vol 166. Springer, Berlin, Heidelberg

Abstract

Computational geometry, considered a subfield of computer science, is concerned with the computational aspects of geometric problems. The increasing activity in this rather young field made it split into several reasonably independent subareas. This paper presents several key-problems of the classical part of computational geometry which exhibit strong interrelations. A unified view of the problems is stressed, and the general ideas behind the methods that solve them are worked out.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1984

Authors and Affiliations

  • Herbert Edelsbrunner
    • 1
  1. 1.Institutes for Information Processing Technical University of GrazGrazAustria

Personalised recommendations