Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Handbook of computational geometry [[electronic resource] /] / edited by J.-R. Sack, J. Urrutia
| Handbook of computational geometry [[electronic resource] /] / edited by J.-R. Sack, J. Urrutia |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | New York ; ; Amsterdam, : Elsevier, 2000 |
| Descrizione fisica | 1 online resource (1087 p.) |
| Disciplina |
516.00285
516/.00285 21 |
| Altri autori (Persone) |
SackJ.-R <1954-> (Jörg-Rüdiger)
UrrutiaJ (Jorge) |
| Soggetto topico |
Geometry - Data processing
Computer graphics Combinatorial geometry |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-05842-4
9786611058425 0-08-052968-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
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
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 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; Chapter 22. Art gallery and illumination problems; Author Index; Subject Index |
| Record Nr. | UNINA-9910511322503321 |
| New York ; ; Amsterdam, : Elsevier, 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of computational geometry [[electronic resource] /] / edited by J.-R. Sack, J. Urrutia
| Handbook of computational geometry [[electronic resource] /] / edited by J.-R. Sack, J. Urrutia |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | New York ; ; Amsterdam, : Elsevier, 2000 |
| Descrizione fisica | 1 online resource (1087 p.) |
| Disciplina |
516.00285
516/.00285 21 |
| Altri autori (Persone) |
SackJ.-R <1954-> (Jörg-Rüdiger)
UrrutiaJ (Jorge) |
| Soggetto topico |
Geometry - Data processing
Computer graphics Combinatorial geometry |
| ISBN |
1-281-05842-4
9786611058425 0-08-052968-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
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
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 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; Chapter 22. Art gallery and illumination problems; Author Index; Subject Index |
| Record Nr. | UNINA-9910783135303321 |
| New York ; ; Amsterdam, : Elsevier, 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||