Computational Geometry: An Introduction Through Randomized Algorithms (Paperback)

Ketan Mulmuley

  • 出版商: Pearson
  • 出版日期: 1993-06-18
  • 定價: USD $105.20
  • 售價: $690
  • 貴賓價: 9.8$676
  • 語言: 英文
  • 頁數: 447
  • 裝訂: Paperback
  • ISBN: 0133363635
  • ISBN-13: 9780133363630

下單後立即進貨 (2週~3週)

買這商品的人也買了...

產品描述

傳送訂單至便利達康

Description:

For beginning graduate-level courses in computational geometry.

This up-to-date and concise introduction to computational geometry — with emphasis on simple randomized methods — is designed for quick, easy access to beginners.

 

Table of Contents:

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.