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週)
買這商品的人也買了...
-
Kinect 體感程式探索－使用 C#$460售價: $230 -
貴賓價: $1,485The Mac Hacker's Handbook (Paperback) -
貴賓價: $788Challenges for Game Designers (Paperback) -
貴賓價: $1,140Probability and Computing: Randomized Algorithms and Probabilistic Analysis -
Distributed Algorithms$1,500貴賓價: $1,425 -
售價: $2,800File System Forensic Analysis (Paperback) -
貴賓價: $1,890Microsoft Visual Studio 2015 Unleashed, 3/e (Paperback) -
貴賓價: $279超標量處理器設計 -
揭開設計模式的秘辛 ── 設計模式 第1 3/4版 『Pattern hatching : design patterns applied』$390售價: $304 -
大話重構$390售價: $304 -
創新科技設計｜基因組學、機器人學與物聯網的UX設計(Designing for Emerging Technologies: UX for Genomics, Robotics, and the Internet of Things)$680售價: $537 -
貴賓價: $507數據庫查詢優化器的藝術－原理解析與 SQL 性能優化 -
數據獵殺：一場輸不起的全球網路戰爭／Data Hunting-A Worldwide Cyberwar Is Beginning$320售價: $272 -
Big Data－驅動大企業的幕後推手 (Big Data: Understanding How Data Powers Big Business)$380貴賓價: $289 -
Android 及 ARM 原生語言─逆向工程破解 Android APP 安全, 2/e$590售價: $502 -
Windows 核心原理與實務開發$780售價: $616 -
圖解資料學：超實用！資料蒐集與分析的方法，一次學會$280貴賓價: $252 -
貴賓價: $336大型網站技術架構－核心原理與案例分析 -
售價: $1,650Big Data: Principles and best practices of scalable realtime data systems (Paperback) -
貴賓價: $1,422Black-Box Testing: Techniques for Functional Testing of Software and Systems (Paperback)
產品描述
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.