Jean-Daniel Boissonnat
Algorithmic Geometry
Jean-Daniel Boissonnat
Algorithmic Geometry
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
Advanced textbook in computational geometry; algorithmic approach.
Andere Kunden interessierten sich auch für
Foga'17 Conference CommitteeFOGA'17 Foundations of Genetic Algorithms XIV47,99 €
Spaa 13 Conference CommitteeSpaa 13 Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures87,99 €
Spaa 15 Conference CommitteeSPAA 15 27th ACM Symposium on Parallelism in Algorithms and Architectures89,99 €
FOGA XII Conference CommitteeFOGA XII Proceedings of the Twelfth ACM Workshop on Foundation of Genetic Algorithms50,99 €
Foga 15 Conference CommitteeFOGA 15 Foundations on Genetic Algorithms XIII51,99 €
Spaa 16 Conference CommitteeSPAA 16 28th ACM Symposium on Parallelism in Algorithms and Architectures120,99 €
Martin PuryearAlgorithm Challenges, paperback22,99 €-
-
-
Produktdetails
- Produktdetails
- Verlag: Cambridge University Press
- Seitenzahl: 544
- Erscheinungstermin: 5. Januar 2005
- Englisch
- Abmessung: 246mm x 189mm x 29mm
- Gewicht: 1039g
- ISBN-13: 9780521565295
- ISBN-10: 0521565294
- Artikelnr.: 22092180
- Herstellerkennzeichnung
- Libri GmbH
- Europaallee 1
- 36244 Bad Hersfeld
- gpsr@libri.de
- Verlag: Cambridge University Press
- Seitenzahl: 544
- Erscheinungstermin: 5. Januar 2005
- Englisch
- Abmessung: 246mm x 189mm x 29mm
- Gewicht: 1039g
- ISBN-13: 9780521565295
- ISBN-10: 0521565294
- Artikelnr.: 22092180
- Herstellerkennzeichnung
- Libri GmbH
- Europaallee 1
- 36244 Bad Hersfeld
- gpsr@libri.de
Preface
Part I. Algorithmic Tools: 1. Notions of complexity
2. Basic data structures
3. Deterministic methods used in geometry
4. Random sampling
5. Randomized algorithms
6. Dynamic randomized algorithms
Part II. Convex Hulls: 7. Polytopes
8. Incremental convex hulls
9. Convex hulls in 2 and 3 dimensions
10. Linear programming
Part III. Triangulations: 11. Complexes and triangulations
12 Triangulations in dimension 2
13. Triangulations in dimension 3
Part IV. Arrangements: 14. Arrangements of hyperplanes
15. Arrangements of line segments in the plane
16. Arrangements of triangles
Part V. Voronoi Diagrams: 17. Euclidean metrics
18. Non-Euclidean metrics
19. Diagrams in the plane
References
Notation
Index.
Part I. Algorithmic Tools: 1. Notions of complexity
2. Basic data structures
3. Deterministic methods used in geometry
4. Random sampling
5. Randomized algorithms
6. Dynamic randomized algorithms
Part II. Convex Hulls: 7. Polytopes
8. Incremental convex hulls
9. Convex hulls in 2 and 3 dimensions
10. Linear programming
Part III. Triangulations: 11. Complexes and triangulations
12 Triangulations in dimension 2
13. Triangulations in dimension 3
Part IV. Arrangements: 14. Arrangements of hyperplanes
15. Arrangements of line segments in the plane
16. Arrangements of triangles
Part V. Voronoi Diagrams: 17. Euclidean metrics
18. Non-Euclidean metrics
19. Diagrams in the plane
References
Notation
Index.
Preface
Part I. Algorithmic Tools: 1. Notions of complexity
2. Basic data structures
3. Deterministic methods used in geometry
4. Random sampling
5. Randomized algorithms
6. Dynamic randomized algorithms
Part II. Convex Hulls: 7. Polytopes
8. Incremental convex hulls
9. Convex hulls in 2 and 3 dimensions
10. Linear programming
Part III. Triangulations: 11. Complexes and triangulations
12 Triangulations in dimension 2
13. Triangulations in dimension 3
Part IV. Arrangements: 14. Arrangements of hyperplanes
15. Arrangements of line segments in the plane
16. Arrangements of triangles
Part V. Voronoi Diagrams: 17. Euclidean metrics
18. Non-Euclidean metrics
19. Diagrams in the plane
References
Notation
Index.
Part I. Algorithmic Tools: 1. Notions of complexity
2. Basic data structures
3. Deterministic methods used in geometry
4. Random sampling
5. Randomized algorithms
6. Dynamic randomized algorithms
Part II. Convex Hulls: 7. Polytopes
8. Incremental convex hulls
9. Convex hulls in 2 and 3 dimensions
10. Linear programming
Part III. Triangulations: 11. Complexes and triangulations
12 Triangulations in dimension 2
13. Triangulations in dimension 3
Part IV. Arrangements: 14. Arrangements of hyperplanes
15. Arrangements of line segments in the plane
16. Arrangements of triangles
Part V. Voronoi Diagrams: 17. Euclidean metrics
18. Non-Euclidean metrics
19. Diagrams in the plane
References
Notation
Index.







