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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, second edition, 2000.
H. Edelsbrunner. Algorithms for Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
J. Goodman and J. O’Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, second edition, 2004.
K. Mulmuley. Computational Geometry: an introduction through randomized algorithms. Prentice-Hall, New York, 1994.
F. Preparata and M. Shamos. Computational Geometry. Springer-Verlag, New York, 1985.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag London Limited
About this chapter
Cite this chapter
Skiena, S.S. (2012). Computational Geometry. In: The Algorithm Design Manual. Springer, London. https://doi.org/10.1007/978-1-84800-070-4_17
Download citation
DOI: https://doi.org/10.1007/978-1-84800-070-4_17
Publisher Name: Springer, London
Print ISBN: 978-1-84800-069-8
Online ISBN: 978-1-84800-070-4
eBook Packages: Computer ScienceComputer Science (R0)