Computational Geometry by Ketan Mulmuley
An Introduction through Randomized Algorithms
A concise, rigorous introduction to the algorithmic foundations of geometric computation that presents key problems (convex hulls, Voronoi diagrams, Delaunay triangulations, range searching, motion-planning and intersection detection) together with efficient algorithmic techniques such as divide-and-conquer, plane-sweep, randomized incremental construction, and geometric data structures. The text emphasizes formal analysis of running time and space, probabilistic methods and lower-bound arguments, and the design principles needed to translate geometric insight into provably efficient algorithms. Numerous examples and proofs illustrate how to handle degeneracies and implement robust solutions, making it suitable for advanced undergraduate or graduate courses and as a reference for researchers.
- Published
- 1994
- Nationality
- American
- Length
- Unknown
- Pages
- Unknown
- Original Language
- English
- Avg User Rating
-
(3.0)
- Alternate Titles
- None
This book is not currently on any lists.