| DC Field | Value | Language |
|---|
| dc.contributor.author | Berg, Mark de | - |
| dc.date.accessioned | 2021-04-19T04:57:28Z | - |
| dc.date.available | 2021-04-19T04:57:28Z | - |
| dc.date.issued | 2008 | - |
| dc.identifier.isbn | 978-3-540-77974-2 | - |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/61 | - |
| dc.description | This third edition contains two major additions: In
Chapter 7, on Voronoi diagrams, we now also discuss Voronoi diagrams of line
segments and farthest-point Voronoi diagrams. In Chapter 12, we have included
an extra section on binary space partition trees for low-density scenes, as an
introduction to realistic input models. In addition, a large number of small and
some larger errors have been corrected (see the list of errata for the second
edition on the Web site). We have also updated the notes and comments of every
chapter to include references to recent results and recent literature. We have
tried not to change the numbering of sections and exercises, so that it should be
possible for students in a course to still use the second edition. | en_US |
| dc.description.abstract | Computational geometry emerged from the field 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 field 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 difficult to understand and implement. In recent years a number of new
algorithmic techniques have been developed that improved and simplified 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. | en_US |
| dc.publisher | Springer | en_US |
| dc.subject | Geometry | en_US |
| dc.subject | Computational geometry | en_US |
| dc.title | Computational Geometry | en_US |
| dc.title.alternative | Algorithms and Applications | en_US |
| dc.type | Book | en_US |
| Appears in Collections: | ARTS & SCIENCE
|
