Nicht aus der Schweiz? Besuchen Sie lehmanns.de

Computational Geometry

Algorithms and Applications
Buch | Hardcover
XII, 386 Seiten
2008 | 3rd ed. 2008
Springer Berlin (Verlag)
978-3-540-77973-5 (ISBN)

Lese- und Medienproben

Computational Geometry - Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars
CHF 74,85 inkl. MwSt
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.

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.

"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

Erscheint lt. Verlag 7.3.2008
Zusatzinfo XII, 386 p. 370 illus.
Verlagsort Berlin
Sprache englisch
Maße 189 x 246 mm
Gewicht 925 g
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Geometrie / Topologie
Schlagworte algorithm • Algorithm analysis and problem complexity • Algorithmische Geometrie • algorithms • area • CAD/CAM • CAM • Computational Geometry • Computer Graphics • Computer Science • Database • data structure • data structures • Geographical Information Systems • geometric algorithms • Geometric Data Structures • Information • linear optimization • Partition • programming • robot • Robotics • Triangulation
ISBN-10 3-540-77973-6 / 3540779736
ISBN-13 978-3-540-77973-5 / 9783540779735
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 48,95
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Eine Einführung in die Systemtheorie

von Margot Berghaus

Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95