| 书目名称 | Computational Geometry | | 副标题 | Algorithms and Appli | | 编辑 | Mark Berg,Otfried Cheong,Mark Overmars | | 视频video | | | 概述 | A broad overview of the major algorithms and data structures of the field.Motivated from applications.Covers concepts and techniquesto be presented in any course on computational geometry.Self-contain | | 图书封面 |  | | 描述 | Computational geometry emerged from the ?eld of algorithms design and analysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The success of the ?eld as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains—computer graphics, geographic information systems (GIS), robotics, and others—in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or dif?cult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simpli?ed many of the previous approaches. In this textbook we have tried to make these modern algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry,but it can also be used for self-study. | | 出版日期 | Textbook 2008Latest edition | | 关键词 | Area; CAM; Partition; Triangulation; algorithm; algorithms; computer science; data structure; data structure | | 版次 | 3 | | doi | https://doi.org/10.1007/978-3-540-77974-2 | | isbn_softcover | 978-3-642-09681-5 | | isbn_ebook | 978-3-540-77974-2 | | copyright | Springer-Verlag GmbH Germany, part of Springer Nature 2008 |
The information of publication is updating
|
|
发表于 2025-3-21 19:17:43
