Home > Store > Programming > Algorithms

Computational Geometry: An Introduction Through Randomized Algorithms

Register your product to gain access to bonus material or receive a coupon.

Computational Geometry: An Introduction Through Randomized Algorithms


  • Your Price: $88.40
  • List Price: $104.00
  • Available on demand.



  • first develops basic principles with the help of very simple planar applications — beginning with deterministic algorithms and shifting to randomized algorithms as the problems become more complex.
  • then explores higher dimensional advanced applications in the second part.
  • provides an abundance of exercises — ranging from the routine to the very difficult.


  • Copyright 1993
  • Dimensions: 6 1/2x9 1/4
  • Pages: 447
  • Edition: 1st
  • Book
  • ISBN-10: 0-13-336363-5
  • ISBN-13: 978-0-13-336363-0

Sr/Grad intro to computational Geometry, a sub-set of the algorithms field. Randomized algorithms provide the basis for a unified broad perspective of the topic. This remains one of the fastest growing areas in computer science. This author developed much of the theory around randomized algorithms.

Sample Content

Table of Contents


1. Quick-sort and Search.

Quick-sort. Another view of quick-sort. Randomized binary trees. Skip lists.

2. What Is Computational Geometry?

Range queries. Arrangements. Trapezoidal decompositions. Convex polytopes. Voronoi diagrams. Hidden surface removal. Numerical precision and degeneracies. Early deterministic algorithms. Deterministic vs. randomized algorithms. The model of randomness.

3. Incremental Algorithms.

Trapezoidal decompositions. Convex polytopes. Voronoi diagrams. Configuration spaces. Tail estimates.

4. Dynamic Algorithms.

trapezoidal decompositions. Voronoi diagrams. History and configuration spaces. Rebuilding history. Deletions in history. Dynamic shuffling.

5. Random Sampling.

Configuration spaces with bounded valence. Top-down sampling. Bottom-up sampling. Dynamic sampling. Average conflict size. More dynamic algorithms. Range spaces and E-nets. Comparisons.


6. Arrangements of Hyperplanes.

Incremental construction. Zone Theorem. Canonical triangulations. Point location and ray shooting. Point location and range queries.

7. Convex Polytopes.

Linear Programming. The number of faces. Incremental construction. The expected structural and conflict change. Dynamic maintenance. Voronoi diagrams. Search problems. Levels and Voronoi diagrams of order k.

8. Range Search.

Orthogonal intersection search. Nonintersecting segments in the plane. Dynamic point location. Simplex range search. Half-space range queries. Decomposable search problems. Parametric search.

9. Computer Graphics.

Hidden surface removal. Binary Space Partitions. Moving viewpoint.

10. How Crucial Is Randomness?

Pseudo-random sources. Derandomization.

Appendix: Tail Estimates.

Chernoff's technique. Chebychev's technique.



Submit Errata

More Information

Unlimited one-month access with your purchase
Free Safari Membership