Computational Geometry: An Introduction Through Randomized Algorithms (Paperback)
Ketan Mulmuley
- 出版商: Pearson
- 出版日期: 1993-06-18
- 售價: $690
- 貴賓價: 9.8 折 $676
- 語言: 英文
- 頁數: 447
- 裝訂: Paperback
- ISBN: 0133363635
- ISBN-13: 9780133363630
-
相關分類:
Algorithms-data-structures 資料結構與演算法
下單後立即進貨 (3週~5週)
買這商品的人也買了...
-
![]()
數位邏輯設計 (Fundamentals of Logic Design, 5/e)$700貴賓價: $679 -
![]()
貴賓價: $1,537Building Embedded Linux Systems -
![]()
初探網路安全 (Network Security first-step)$480貴賓價: $379 -
![]()
駭客防護實戰系列─木馬防護全攻略$490貴賓價: $387 -
![]()
防網路釣魚 + 側錄 + 間諜 + 詐騙 + 毒駭$480售價: $408 -
![]()
貴賓價: $1,068Fundamentals of Database Systems, 4/e (IE) -
![]()
現代嵌入式系統開發專案實務－菜鳥成長日誌與專案經理的私房菜$600售價: $480 -
![]()
資料結構－使用 C 語言 (Fundamentals of Data Structures in C)$450售價: $266 -
![]()
Lotus Notes 與 Domino 6 程式設計寶典 上冊 (Lotus Notes and Domino 6 Programming Bible)$500貴賓價: $450 -
![]()
貴賓價: $998Fundamentals of Data Structures in C -
![]()
C++ Primer, 4/e (中文版)$990貴賓價: $891 -
![]()
寫給 SA 的 UML/MDA 實務手冊$350貴賓價: $277 -
![]()
Ajax 實戰手冊 (Ajax in Action)$680售價: $537 -
![]()
貴賓價: $2,660File System Forensic Analysis (Paperback) -
![]()
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 -
![]()
鳥哥的 Linux 私房菜基礎學習篇, 2/e$780貴賓價: $616 -
![]()
深入淺出設計模式 (Head First Design Patterns)$880售價: $695 -
![]()
Linux 核心詳解, 3/e (Understanding the Linux Kernel, 3/e)$1,200售價: $948 -
![]()
線性代數 (Linear Algebra with application, 5/e)$620貴賓價: $601 -
![]()
工程數學 (Advanced Engineering Mathematics, 3/e) (精華本)$700貴賓價: $679 -
![]()
鳥哥的 Linux 私房菜─基礎學習篇增訂版$560貴賓價: $442
商品描述
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.