Computational geometry : algorithms and applications
 Responsibility
 Mark de Berg ... [et al.].
 Language
 English.
 Edition
 2nd, rev. ed.
 Imprint
 Berlin ; New York : Springer, c2000.
 Physical description
 xii, 367 p. : ill. ; 25 cm.
Access
Available online
Math & Statistics Library
Stacks
Call number  Status 

QA448 .D38 C65 2000  Unknown 
QA448 .D38 C65 2000  Unknown 
More options
Creators/Contributors
 Contributor
 Berg, Mark de.
Contents/Summary
 Bibliography
 Includes bibliographical references (p. 341357) and index.
 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: NonUniform Mesh Generation. Visibility Graphs: Finding the Shortest Route. Simplex Range Searching: Windowing Revisited. Bibliography. Index.
 (source: Nielsen Book Data)
 Publisher's Summary
 This wellaccepted introduction to computational geometry is a textbook for highlevel undergraduate and lowlevel 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 selfcontained and can be used for selfstudy 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.
(source: Nielsen Book Data)
Subjects
 Subject
 Geometry > Data processing.
Bibliographic information
 Publication date
 2000
 ISBN
 3540656200 (alk. paper)
 9783540656203 (alk. paper)