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.
KeywordsConvex Hull Motion Planning Voronoi Diagram Computational Geometry Delaunay Triangulation
Unable to display preview. Download preview PDF.
- [Ede87]H. Edelsbrunner. Algorithms for Combinatorial Geometry. Springer-Verlag, Berlin, 1987.Google Scholar
- [GO04]J. Goodman and J. O’Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, second edition, 2004.Google Scholar
- [Mul94]K. Mulmuley. Computational Geometry: an introduction through randomized algorithms. Prentice-Hall, New York, 1994.Google Scholar
- [PS85]F. Preparata and M. Shamos. Computational Geometry. Springer-Verlag, New York, 1985.Google Scholar