Geometric Approximation Algorithms
Sariel Har-Peled
2011年1月 · Mathematical Surveys and Monographs 第 173 冊 · American Mathematical Soc.
電子書
362
頁數
report評分和評論未經驗證 瞭解詳情
關於這本電子書
Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. These algorithms tend to be simple, fast, and more robust than their exact counterparts. This book is the first to cover geometric approximation algorithms in detail. In addition, more traditional computational geometry techniques that are widely used in developing such algorithms, like sampling, linear programming, etc., are also surveyed. Other topics covered include approximate nearest-neighbor search, shape approximation, coresets, dimension reduction, and embeddings. The topics covered are relatively independent and are supplemented by exercises. Close to 200 color figures are included in the text to illustrate proofs and ideas.
關於作者
Sariel Har-Peled, University of Illinois at Urbana-Champaign, IL
為這本電子書評分
請分享你的寶貴意見。
閱讀資訊
智能手機和平板電腦
手提電腦和電腦
你可以使用電腦的網絡瀏覽器聆聽在 Google Play 上購買的有聲書。
電子書閱讀器及其他裝置
如要在 Kobo 等電子墨水裝置上閱覽書籍，你需要下載檔案並傳輸到你的裝置。請按照說明中心的詳細指示，將檔案傳輸到支援的電子書閱讀器。
