TY  - BOOK
AU  - Berg,Mark de
AU  - Kreveld,Marc van
AU  - Overmars,Mark
AU  - Schwarzkopf,Otfried
ED  - SpringerLink (Online service)
TI  - Computational Geometry: Algorithms and Applications 
SN  - 9783662034279
AV  - QA76.9.M35 
U1  - 004.0151 23
PY  - 1997///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg, Imprint: Springer
KW  - Computer science—Mathematics
KW  - Computer-aided engineering
KW  - Computer graphics
KW  - Dynamics
KW  - Nonlinear theories
KW  - Earth sciences
KW  - Mathematics
KW  - Mathematical Applications in Computer Science
KW  - Computer-Aided Engineering (CAD, CAE) and Design
KW  - Computer Graphics
KW  - Applied Dynamical Systems
KW  - Earth Sciences
KW  - Applications of Mathematics
N1  - 1 Computational Geometry: Introduction -- 2 Line Segment Intersection: Thematic Map Overlay -- 3 Polygon Triangulation: Guarding an Art Gallery -- 4 Linear Programming: Manufacturing with Molds -- 5 Orthogonal Range Searching: Querying a Database -- 6 Point Location: Knowing Where You Are -- 7 Voronoi Diagrams: The Post Office Problem -- 8 Arrangements and Duality: Supersampling in Ray Tracing -- 9 Delaunay Triangulations: Height Interpolation -- 10 More Geometric Data Structures: Windowing -- 11 Convex Hulls: Mixing Things -- 12 Binary Space Partitions: The Painter’s Algorithm -- 13 Robot Motion Planning: Getting Where You Want to Be -- 14 Quadtrees: Non-Uniform Mesh Generation -- 15 Visibility Graphs: Finding the Shortest Route -- 16 Simplex Range Searching: Windowing Revisited
N2  - This all-new 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
UR  - https://doi.org/10.1007/978-3-662-03427-9
ER  -