Computational Geometry: An Introduction Through Randomized Algorithms (Paperback)
Ketan Mulmuley
下單後立即進貨 (3週~5週)
買這商品的人也買了...
-
![]()
Kinect 體感程式探索－使用 C#$460售價: $271 -
![]()
貴賓價: $1,403The Mac Hacker's Handbook (Paperback) -
![]()
售價: $700Challenges for Game Designers (Paperback) -
![]()
貴賓價: $1,140Probability and Computing: Randomized Algorithms and Probabilistic Analysis -
![]()
貴賓價: $1,425Distributed Algorithms -
![]()
貴賓價: $2,660File System Forensic Analysis (Paperback) -
![]()
貴賓價: $1,881Microsoft Visual Studio 2015 Unleashed, 3/e (Paperback) -
![]()
貴賓價: $279超標量處理器設計 -
![]()
從需求到設計：如何設計出客戶想要的產品 (十週年紀念版) (Exploring Requirements: Quality Before Design)$580售價: $522 -
![]()
貴賓價: $1,008Sprint: How to Solve Big Problems and Test New Ideas in Just Five Days -
![]()
貴賓價: $1,103Design Sprint: A Practical Guidebook for Building Great Digital Products (Paperback) -
![]()
專業倫理：企業倫理、法律倫理、設計倫理、一般倫理$350售價: $315 -
![]()
貴賓價: $709Cypherpunks: Freedom and the Future of the Internet -
![]()
演算法圖鑑：26種演算法 + 7種資料結構，人工智慧、數據分析、邏輯思考的原理和應用 step by step 全圖解$450售價: $356 -
![]()
CSS 重構 (CSS Refactoring: Architect Your Stylesheets for Success)$450售價: $356 -
![]()
CSS Secrets 中文版｜解決網頁設計問題的有效秘訣 (CSS Secrets: Better Solutions to Everyday Web Design Problems)$680售價: $537 -
![]()
網站可靠性工程｜Google的系統管理之道 (Site Reliability Engineering: How Google Runs Production Systems)(SRE)$780售價: $616 -
![]()
Soft Skills 軟實力｜軟體開發人員的生存手冊 (Soft Skills: The software developer's life manual)$520售價: $411 -
![]()
揭開設計模式的秘辛 ── 設計模式 第1 3/4版 『Pattern hatching : design patterns applied』$390售價: $304 -
![]()
大話重構$390售價: $304
商品描述
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.