Computational Geometry An Introduction Through Randomized Algorithms

Name: Computational Geometry An Introduction Through Randomized Algorithms
Price: 20.12 USD
Availability: InStock
ISBN: 9780133363630

ISBN-10: 0133363635

ISBN-13: 9780133363630

Edition: 1993

Authors: Ketan Mulmuley

List price: $105.20

30 day, 100% satisfaction guarantee!

Marketplace

3 new & used from $20.12

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Book details

List price: $105.20
Copyright year: 1993
Publisher: Prentice Hall PTR
Publication date: 6/8/1993
Binding: Paperback
Pages: 447
Size: 7.00" wide x 9.75" long x 1.50" tall
Weight: 1.848
Language: English




Basics



Quick-sort and Search


Quick-sort


Another view of quick-sort


Randomized binary trees


Skip lists



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



Incremental Algorithms


Trapezoidal decompositions


Convex polytopes


Voronoi diagrams


Configuration spaces


Tail estimates


4


trapezoidal decompositions


Voronoi diagrams


History and configuration spaces


Rebuilding history


Deletions in history


Dynamic shuffling



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



Applications



Arrangements of Hyperplanes


Incremental construction


Zone Theorem


Canonical triangulations


Point location and ray shooting


Point location and range queries



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 orderk



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



Computer Graphics


Hidden surface removal


Binary Space Partitions


Moving viewpoint



How Crucial Is Randomness? Pseudo-random sources


Derandomization


Appendix: Tail Estimates


Chernoff's technique


Chebychev's technique


Bibliography


Index