| 書目名稱 | New Trends in Discrete and Computational Geometry |
| 編輯 | János Pach |
| 視頻video | http://file.papertrans.cn/666/665925/665925.mp4 |
| 叢書名稱 | Algorithms and Combinatorics |
| 圖書封面 |  |
| 描述 | Discrete and computational geometry are two fields which in recent years have benefitted from the interaction between mathematics and computer science. The results are applicable in areas such as motion planning, robotics, scene analysis, and computer aided design. The book consists of twelve chapters summarizing the most recent results and methods in discrete and computational geometry. All authors are well-known experts in these fields. They give concise and self-contained surveys of the most efficient combinatorical, probabilistic and topological methods that can be used to design effective geometric algorithms for the applications mentioned above. Most of the methods and results discussed in the book have not appeared in any previously published monograph. In particular, this book contains the first systematic treatment of epsilon-nets, geometric tranversal theory, partitions of Euclidean spaces and a general method for the analysis of randomized geometric algorithms. Apart from mathematicians working in discrete and computational geometry this book will also be of great use to computer scientists and engineers, who would like to learn about the most recent results. |
| 出版日期 | Book 1993 |
| 關(guān)鍵詞 | Algorithmentheorie; Approximation von Hyperebenen; Combinatorics; Epsilonnetze; Kombinatorik; Konvexit?t; |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-58043-7 |
| isbn_softcover | 978-3-642-63449-9 |
| isbn_ebook | 978-3-642-58043-7Series ISSN 0937-5511 Series E-ISSN 2197-6783 |
| issn_series | 0937-5511 |
| copyright | Springer-Verlag Berlin Heidelberg 1993 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-9 16:39
發(fā)表于 2025-3-21 19:03:28
