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 $38.96
You save: 63%
Marketplace Item
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
Seller Condition Comments Price  
Seller: secondsale
Location: Montgomery, IL Ask seller a question
Condition: Good
Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc...
Price:
$38.96
Comments:
Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc...
Seller: GoodDealsOnUsedBooks
Location: Aurora, IL
Condition: Good
Shipping Icon
0133363635 Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc...
Price:
$43.82
Comments:
0133363635 Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc...
Seller: Ergodebooks
Location: Richmond, TX Ask seller a question
Condition: Good
Buy with confidence. Excellent Customer Service & Return policy.Ships Fast. 24*7 Customer Service.
Price:
$54.12
Comments:
Buy with confidence. Excellent Customer Service & Return policy.Ships Fast. 24*7 Customer Service.
Seller: Moe's Books
Location: Berkeley, CA
Condition: Like New
Price:
$56.25
Comments:
Seller: Rodney's Bookstore
Location: Cambridge, MA
Condition: Very Good
0133363635 Clean pages and sound binding.
Price:
$63.00
Comments:
0133363635 Clean pages and sound binding.
Seller: Found Books
Location: AUSTIN, TX
Condition: Good
0133363635.
Price:
$82.12
Comments:
0133363635.
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: ).