{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":24,"n_cols":5,"rows_kept":24,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[10,2,10,3],[14,2,14,3],[15,2,15,3],[19,2,19,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910511322503321"]
[null,null,"Titolo",null,"Handbook of computational geometry [[electronic resource] /] / edited by J.-R. Sack, J. Urrutia"]
[null,null,"Pubbl/distr/stampa",null,"New York ; ; Amsterdam, : Elsevier, 2000"]
[null,null,"ISBN",null,"1-281-05842-4"]
[{"$nulls":4},"9786611058425"]
[{"$nulls":4},"0-08-052968-2"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (1087 p.)"]
[null,null,"Disciplina",null,"516.00285"]
[{"$nulls":4},"516/.00285 21"]
[null,null,"Soggetti",null,"Geometry - Data processing"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Combinatorial geometry"]
[{"$nulls":4},"Electronic books."]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and indexes."]
[null,null,"Nota di contenuto",null,"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 systems"]
[{"$nulls":4},"Chapter 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"]
[{"$nulls":4},"Chapter 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; "]
[{"$nulls":4},"Chapter 22. Art gallery and illumination problems; Author Index; Subject Index"]
[null,null,null,"Sommario/riassunto","Computational 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."]