000 04191nam a22006255i 4500
001 978-3-540-77974-2
003 DE-He213
005 20220801140059.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540779742
_9978-3-540-77974-2
024 7 _a10.1007/978-3-540-77974-2
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
100 1 _ade Berg, Mark.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_931931
245 1 0 _aComputational Geometry
_h[electronic resource] :
_bAlgorithms and Applications /
_cby Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars.
250 _a3rd ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aXII, 386 p. 370 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aComputational 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.
520 _aComputational 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.
650 0 _aComputer science.
_99832
650 0 _aGeometry.
_921224
650 0 _aComputer science—Mathematics.
_931682
650 0 _aEarth sciences.
_921107
650 0 _aComputer graphics.
_94088
650 0 _aAlgorithms.
_93390
650 1 4 _aTheory of Computation.
_931932
650 2 4 _aGeometry.
_921224
650 2 4 _aMathematical Applications in Computer Science.
_931683
650 2 4 _aEarth Sciences.
_921107
650 2 4 _aComputer Graphics.
_94088
650 2 4 _aAlgorithms.
_93390
700 1 _aCheong, Otfried.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_931933
700 1 _avan Kreveld, Marc.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_931934
700 1 _aOvermars, Mark.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_931935
710 2 _aSpringerLink (Online service)
_931936
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540847441
776 0 8 _iPrinted edition:
_z9783642096815
776 0 8 _iPrinted edition:
_z9783540779735
856 4 0 _uhttps://doi.org/10.1007/978-3-540-77974-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
942 _cEBK
999 _c75158
_d75158