LEADER 03518nam  2200601Ia 450 
001 9910827378403321
005 20200520144314.0
010   $a1-281-05842-4
010   $a9786611058425
010   $a0-08-052968-2
035   $a(CKB)1000000000013415
035   $a(EBL)317189
035   $a(OCoLC)231619465
035   $a(SSID)ssj0000167292
035   $a(PQKBManifestationID)12004238
035   $a(PQKBTitleCode)TC0000167292
035   $a(PQKBWorkID)10169248
035   $a(PQKB)11393517
035   $a(MiAaPQ)EBC317189
035   $a(EXLCZ)991000000000013415
100   $a20000217d2000      uy         0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 00$aHandbook of computational geometry /$fedited by J.-R. Sack, J. Urrutia
205   $a1st ed.
210   $aNew York ;$aAmsterdam $cElsevier$d2000
215   $a1 online resource (1087 p.)
300   $aDescription based upon print version of record.
311   $a0-444-82537-1 
320   $aIncludes bibliographical references and indexes.
327   $aFront Cover; Handbook of Computational Geometry; Copyright Page; Preface; List of Contributors; Contents; Chapter 1. Davenport-Schinzel sequences and their geometric applications; Chapter 2. Arrangements and their applications; Chapter 3. Discrete geometric shapes: Matching, interpolation, and approximation; Chapter 4. Deterministic parallel computational geometry; chapter 5. Voronoi diagrams; Chapter 6. Mesh generation; Chapter 7. Applications of computational geometry to geographic information systems
327   $aChapter 8. Making geometry visible: An introduction to the animation of geometric algorithmsChapter 9. Spanning trees and spanners; Chapter 10. Geometric data structures; Chapter 11. Polygon decomposition; Chapter 12. Link distance problems; Chapter 13. Derandomization in computational geometry; Chapter 14. Robustness and precision issues in geometric computation; Chapter 15. Geometric shortest paths and network optimization; Chapter 16. Randomized algorithms in computational geometry; Chapter 17. Spatial data structures: Concepts and design choices
327   $aChapter 18. Parallel computational geometry: An approach using randomizationChapter 19. Visibility in the plane; Chapter 20. Closest-point problems in computational geometry; Chapter 21. Graph drawing; Chapter 22. Art gallery and illumination problems; Author Index; Subject Index
330   $aComputational Geometry is an area that provides solutions to geometric problems which arise in applications including Geographic Information Systems, Robotics and Computer Graphics. This Handbook provides an overview of key concepts and results in Computational Geometry. It may serve as a reference and study guide to the field. Not only the most advanced methods or solutions are described, but also many alternate ways of looking at problems and how to solve them.
606   $aGeometry$xData processing
606   $aComputer graphics
606   $aCombinatorial geometry
615  0$aGeometry$xData processing.
615  0$aComputer graphics.
615  0$aCombinatorial geometry.
676   $a516/.00285
701   $aSack$b J.-R$g(Jorg-Rudiger),$f1954-$01708135
701   $aUrrutia$b J$g(Jorge)$01708136
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910827378403321
996   $aHandbook of computational geometry$94096913
997   $aUNINA