2008

Computational Geometry

Algorithms and Applications

ISBN: 978-3-540-77973-5 (Print) 978-3-540-77974-2 (Online)

Table of contents (16 chapters)

  1. Front Matter

    Pages i-xii

  2. No Access

    Book Chapter

    Pages 1-17

    Computational Geometry

  3. No Access

    Book Chapter

    Pages 19-43

    Line Segment Intersection

  4. No Access

    Book Chapter

    Pages 45-61

    Polygon Triangulation

  5. No Access

    Book Chapter

    Pages 63-93

    Linear Programming

  6. No Access

    Book Chapter

    Pages 95-120

    Orthogonal Range Searching

  7. No Access

    Book Chapter

    Pages 121-146

    Point Location

  8. No Access

    Book Chapter

    Pages 147-171

    Voronoi Diagrams

  9. No Access

    Book Chapter

    Pages 173-190

    Arrangements and Duality

  10. No Access

    Book Chapter

    Pages 191-218

    Delaunay Triangulations

  11. No Access

    Book Chapter

    Pages 219-241

    More Geometric Data Structures

  12. No Access

    Book Chapter

    Pages 243-258

    Convex Hulls

  13. No Access

    Book Chapter

    Pages 259-281

    Binary Space Partitions

  14. No Access

    Book Chapter

    Pages 283-306

    Robot Motion Planning

  15. No Access

    Book Chapter

    Pages 307-322

    Quadtrees

  16. No Access

    Book Chapter

    Pages 323-333

    Visibility Graphs

  17. No Access

    Book Chapter

    Pages 335-355

    Simplex Range Searching

  18. Back Matter

    Pages 357-386