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.
##好书,还得再多读
评分 评分 评分各位,有没有类似的中国人写的书呀 这本书怎么看着那么别扭呢 特别是关于ARRANGEMENT的 各位,有没有类似的中国人写的书呀 这本书怎么看着那么别扭呢 特别是关于ARRANGEMENT的 各位,有没有类似的中国人写的书呀 这本书怎么看着那么别扭呢 特别是关于ARRANGEMENT的 各位,有...
评分 评分 评分##好书,还得再多读
评分##挑了几个感兴趣的章节读了读,复现了下graham,sweep line和voronoi graph的fortune的实现,voronoi那算法挺复杂的,主要在于需要的BT结构过于奇怪,不找个详细的描述基本没法理解。
本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度,google,bing,sogou 等
© 2025 windowsfront.com All Rights Reserved. 静流书站 版权所有