01008nam--2200361---450-99000175443020331620050906093000.02-86424-136-6000175443USA01000175443(ALEPH)000175443USA0100017544320040614d1992----km-y0itay0103----bafreFR||||||||001yyDes visagesessai d'anthropologieDavid Le BretonParisMétailié1992327 p.22 cmCollection Traversées2001Collection TraverséesFacciaAspetti sociali304.2LE BRETON,David144194ITsalbcISBD990001754430203316II.5. 4583(II f B 530)113013 L.M.II f BBKUMASIAV11020040614USA011649COPAT39020050906USA010930Des visages945383UNISA03578nam 2200613Ia 450 991078313530332120230120004203.01-281-05842-497866110584250-08-052968-2(CKB)1000000000013415(EBL)317189(OCoLC)231619465(SSID)ssj0000167292(PQKBManifestationID)12004238(PQKBTitleCode)TC0000167292(PQKBWorkID)10169248(PQKB)11393517(MiAaPQ)EBC317189(EXLCZ)99100000000001341520000217d2000 uy 0engur|n|---|||||txtccrHandbook of computational geometry[electronic resource] /edited by J.-R. Sack, J. Urrutia1st ed.New York ;Amsterdam Elsevier20001 online resource (1087 p.)Description based upon print version of record.0-444-82537-1 Includes bibliographical references and indexes.Front 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 systemsChapter 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 choicesChapter 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 IndexComputational 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.GeometryData processingComputer graphicsCombinatorial geometryGeometryData processing.Computer graphics.Combinatorial geometry.516.00285516/.00285 21Sack J.-R(Jörg-Rüdiger),1954-1542337Urrutia J(Jorge)1542338MiAaPQMiAaPQMiAaPQBOOK9910783135303321Handbook of computational geometry3794976UNINA