Book 2000

Computational Geometry

Algorithms and Applications

ISBN: 978-3-662-04247-2 (Print) 978-3-662-04245-8 (Online)

Table of contents (16 chapters)

  1. Front Matter

    Pages i-xii

  2. No Access

    Chapter

    Pages 1-17

    Computational Geometry

  3. No Access

    Chapter

    Pages 19-43

    Line Segment Intersection

  4. No Access

    Chapter

    Pages 45-61

    Polygon Triangulation

  5. No Access

    Chapter

    Pages 63-94

    Linear Programming

  6. No Access

    Chapter

    Pages 95-120

    Orthogonal Range Searching

  7. No Access

    Chapter

    Pages 121-146

    Point Location

  8. No Access

    Chapter

    Pages 147-163

    Voronoi Diagrams

  9. No Access

    Chapter

    Pages 165-182

    Arrangements and Duality

  10. No Access

    Chapter

    Pages 183-210

    Delaunay Triangulations

  11. No Access

    Chapter

    Pages 211-233

    More Geometric Data Structures

  12. No Access

    Chapter

    Pages 235-250

    Convex Hulls

  13. No Access

    Chapter

    Pages 251-265

    Binary Space Partitions

  14. No Access

    Chapter

    Pages 267-290

    Robot Motion Planning

  15. No Access

    Chapter

    Pages 291-306

    Quadtrees

  16. No Access

    Chapter

    Pages 307-317

    Visibility Graphs

  17. No Access

    Chapter

    Pages 319-339

    Simplex Range Searching

  18. Back Matter

    Pages 341-367