当前位置：
首页
>
出版信息
>
详细信息
快速检索
数据库：
各中心已购纸本教材
各中心已购电子教材
国内高校课程
国外著名大学课程
外文原版教材出版信息
外文影印版教材出版信息
名校购书信息
关键词：
Computational Geometry
- Algorithms and Applications
书目信息
ISBN：
9783540656203（13位）
中图分类号：
O1
杜威分类号：
中文译名：
计算几何：算法与应用 第2版
作者：
de Berg
编者：
语种：
English
出版信息
出版社：
Springer
出版地：
出版年：
2000
版本：
2nd rev. ed.
版本类型：
原版
丛书题名：
卷期：
文献信息
关键词：
Computer Science
前言：
摘要：
内容简介：
16This 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 the second edition, besides revisions to the first edition, a number of new exercises have been added. 04From the contents:Computational Geometry: Introduction- Line Segment Intersection: Thematic Map Overlay- Polygon Triangulation: Guarding an Art Gallery- Linear Programming: Manufacturing with Molds- Orthogonal Range Searching: Querying a Database- Point Location: Knowing Where You Are- Voronoi Diagrams: The Post Office Problem- Arrangements and Duality: Supersampling in Ray Tracing- Delaunay Triangulations: Height Interpolation- More Geometric Data Structures: Windowing- Convex Hulls: Mixing Things- Binary Space Partitions: The Painter's Algorithm- Robot Motion Planning: Getting Where You Want to Be- Quadtrees: Non-Uniform Mesh Generation- Visibility Graphs: Finding the Shortest Route- Simplex Range Searching: Windowing Revisited- Bibliography- Index
目次：
Computational Geometry: Introduction.- Line Segment Intersection: Thematic Map Overlay.- Polygon Triangulation: Guarding an Art Gallery.- Linear Programming: Manufacturing with Molds.- Orthogonal Range Searching: Querying a Database.- Point Location: Knowing Where You Are.- Voronoi Diagrams: The Post Office Problem.- Arrangements and Duality: Supersampling in Ray Tracing.- Delaunay Triangulations: Height Interpolation.- More Geometric Data Structures: Windowing.- Convex Hulls: Mixing Things.- Binary Space Partitions: The Painter's Algorithm.- Robot Motion Planning: Getting Where You Want to Be.- Quadtrees: Non-Uniform Mesh Generation.- Visibility Graphs: Finding the Shortest Route.- Simplex Range Searching: Windowing Revisited.- Bibliography.- Index.
附录：
全文链接：
读者对象：
grad.
实体信息
页码：
装帧：
hard
尺寸：
其它形态细节：
其它信息
原价：
EUR
32.9500
原版ISBN：
其它ISBN：
图书特色：
书评：
扩展信息
Isbn：
3540656200
issue：
2006JC01
相关附件