Computational Geometry
Algorithms and Applications
Authors: de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.
Free Preview- 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-contained and illustrated with 370 figures
- Additional online material available under http://www.cs.uu.nl/geobook/
- 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
Buy this book
- About this Textbook
-
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.
- Reviews
-
"An excellent introduction to the field is given here, including a general motivation and usage cases beyond simple graphics rendering or interaction." from the ACM Reviews by William Fahle, University of Texas at Dallas, USA
- Table of contents (16 chapters)
-
-
Computational Geometry
Pages 1-17
-
Line Segment Intersection
Pages 19-43
-
Polygon Triangulation
Pages 45-61
-
Linear Programming
Pages 63-93
-
Orthogonal Range Searching
Pages 95-120
-
Table of contents (16 chapters)
Buy this book
Services for this Book
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- Computational Geometry
- Book Subtitle
- Algorithms and Applications
- Authors
-
- Mark de Berg
- Otfried Cheong
- Marc van Kreveld
- Mark Overmars
- Copyright
- 2008
- Publisher
- Springer-Verlag Berlin Heidelberg
- Copyright Holder
- Springer-Verlag GmbH Germany, part of Springer Nature
- eBook ISBN
- 978-3-540-77974-2
- DOI
- 10.1007/978-3-540-77974-2
- Hardcover ISBN
- 978-3-540-77973-5
- Softcover ISBN
- 978-3-642-09681-5
- Edition Number
- 3
- Number of Pages
- XII, 386
- Number of Illustrations
- 370 b/w illustrations
- Topics
