Error title
Some error text about your books and stuff.
Close

Computational Geometry an Introduction Through Randomized Algorithms

by Ketan Mulmuley

Computational Geometry An Introduction Through Randomized Algorithms cover
  • ISBN: 9780133363630
  • ISBN10: 0133363635

Computational Geometry an Introduction Through Randomized Algorithms

by Ketan Mulmuley

  • List Price: $105.20
  • Binding: Paperback
  • Publisher: Pearson
  • Publish date: 08/01/1993
  • ISBN: 9780133363630
  • ISBN10: 0133363635
used Add to Cart $53.72
You save: 49%
Marketplace Item
Product notice Returnable at the third party seller's discretion and may come without consumable supplements like access codes, CD's, or workbooks.
new Add to Cart $89.95
You save: 14%
Marketplace Item
Product notice Returnable at the third party seller's discretion and may come without consumable supplements like access codes, CD's, or workbooks.
Description: I. BASICS. 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. II. APPLICATIONS. 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. Bibliography. Index.
Expand description
Product notice Returnable at the third party seller's discretion and may come without consumable supplements like access codes, CD's, or workbooks.
Seller Condition Comments Price  
Seller: Peninsula FOL
Location: Palos Verdes Estates, CA
Condition: Very Good
Shipping Icon
All proceeds benefit local libraries. Very gently used copy-good value! jn.
Price:
$53.72
Comments:
All proceeds benefit local libraries. Very gently used copy-good value! jn.
Seller: Broad Street Books
Location: Branchville, NJ
Condition: New
Shipping Icon
Brand New Book.
Price:
$89.95
Comments:
Brand New Book.
Seller: GridFreed
Location: North Las Vegas, NV
Condition: New
Price:
$124.38
Comments:
Seller: Bonita
Location: Newport Coast, CA
Condition: Good
Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Price:
$144.00
Comments:
Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Seller: Bonita
Location: Newport Coast, CA
Condition: New
Price:
$242.06
Comments:
please wait
Please Wait

Notify Me When Available

Enter your email address below,
and we'll contact you when your school adds course materials for
.
Enter your email address below, and we'll contact you when is back in stock (ISBN: ).