Advertisement

Computational Geometry

  • Steven S. Skiena

Abstract

Computational geometry is the algorithmic study of geometric problems. Its emergence coincided with application areas such as computer graphics, computer-aided design/manufacturing, and scientific computing, which together provide much of the motivation for geometric computing. The past twenty years have seen enormous maturity in computational geometry, resulting in a significant body of useful algorithms, software, textbooks, and research results.

Keywords

Convex Hull Motion Planning Voronoi Diagram Computational Geometry Delaunay Triangulation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [dBvKOS00]
    M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, second edition, 2000.zbMATHGoogle Scholar
  2. [Ede87]
    H. Edelsbrunner. Algorithms for Combinatorial Geometry. Springer-Verlag, Berlin, 1987.Google Scholar
  3. [GO04]
    J. Goodman and J. O’Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, second edition, 2004.Google Scholar
  4. [Mul94]
    K. Mulmuley. Computational Geometry: an introduction through randomized algorithms. Prentice-Hall, New York, 1994.Google Scholar
  5. [PS85]
    F. Preparata and M. Shamos. Computational Geometry. Springer-Verlag, New York, 1985.Google Scholar

Copyright information

© Springer-Verlag London Limited 2012

Authors and Affiliations

  1. 1.Department of Computer ScienceState University of New York at Stony BrookNew YorkUSA

Personalised recommendations