This well-accepted introduction to computational geometry is a textbook for high-level undergraduate and low-level graduate courses. The focus is on algorithms and hence the book is well suited for students in computer science and engineering. Motivation is provided from the application areas: all solutions and techniques from computational geometry are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. For students this motivation will be especially welcome. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement. All the basic techniques and topics from computational geometry, as well as several more advanced topics, are covered. The book is largely self-contained and can be used for self-study by anyone with a basic background in algorithms. In this third edition, besides revisions to the second edition, new sections discussing Voronoi diagrams of line segments, farthest-point Voronoi diagrams, and realistic input models have been added.
##好书,还得再多读
评分##过了一遍,很精彩
评分##terrible at explanations
评分##对于有这方面兴趣的人来说,这本书可以作为 入门。 但是习题。。。普遍难度不低
评分##讲道理Mark是我在TU/e最喜欢的老师 可惜这门课不是他上
评分##上了一个多月cs274...
评分##只读了Voronoi和凸壳这两章……
评分##挑了几个感兴趣的章节读了读,复现了下graham,sweep line和voronoi graph的fortune的实现,voronoi那算法挺复杂的,主要在于需要的BT结构过于奇怪,不找个详细的描述基本没法理解。
评分##对于有这方面兴趣的人来说,这本书可以作为 入门。 但是习题。。。普遍难度不低
本站所有內容均為互聯網搜索引擎提供的公開搜索信息,本站不存儲任何數據與內容,任何內容與數據均與本站無關,如有需要請聯繫相關搜索引擎包括但不限於百度,google,bing,sogou 等
© 2025 tushu.tinynews.org All Rights Reserved. 求知書站 版权所有