Title: Algorithmic geometry /
Authors: Boissonnat, J.-D. 1953-; Yvinec, Mariette, 1953-
Publisher: Cambridge University Press,
Year: 1998
Subjects: Geometry Data processing; Algorithms.
Contents: Pt. I. Algorithmic tools. Ch. 1. Notions of complexity. Ch. 2. Basic data structures. Ch. 3. Deterministic methods used in geometry. Ch. 4. Random sampling. Ch. 5. Randomized algorithms. Ch. 6. Dynamic randomized algorithms -- Pt. II. Convex hulls. Ch. 7. Polytopes. Ch. 8. Incremental convex hulls. Ch. 9. Convex hulls in two and three dimensions. Ch. 10. Linear programming -- Pt. III. Triangulations. Ch. 11. Complexes and triangulations. Ch. 12. Triangulations in dimension 2. Ch. 13. Triangulations in dimension 3 -- Pt. IV. Arrangements. Ch. 14. Arrangements of hyperplanes. Ch. 15. Arrangements of line segments in the plane. Ch. 16. Arrangements of triangles -- Pt. V. Voronoi diagrams. Ch. 17. Euclidean metric. Ch. 18. Non-Euclidean metrics. Ch. 19. Diagrams in the plane.