Computational Geometry

1. Front Matter

   Pages i-xii

   PDF

2. Computational Geometry

   • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

   Pages 1-17

3. Line Segment Intersection

   • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

   Pages 19-43

4. Polygon Triangulation

   • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

   Pages 45-61

5. Linear Programming

   • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

   Pages 63-92

6. Orthogonal Range Searching

   • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

   Pages 93-117

7. Point Location

   • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

   Pages 119-144

8. Voronoi Diagrams

   • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

   Pages 145-161

9. Arrangements and Duality

   • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

   Pages 163-180

10. Delaunay Triangulations

    • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

    Pages 181-207

11. More Geometric Data Structures

    • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

    Pages 209-231

12. Convex Hulls

    • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

    Pages 233-248

13. Binary Space Partitions

    • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

    Pages 249-263

14. Robot Motion Planning

    • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

    Pages 265-288

15. Quadtrees

    • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

    Pages 289-304

16. Visibility Graphs

    • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

    Pages 305-315

17. Simplex Range Searching

    • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf

    Pages 317-337

18. Back Matter

    Pages 339-367

    PDF

Computational geometry emerged from the field of algorithms design and anal­ ysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The suc­ cess of the field as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains--computer graphics, geographic in­ formation systems (GIS), robotics, and others-in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or difficult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simplified many of the previous approaches. In this textbook we have tried to make these modem algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry, but it can also be used for self-study.

• Algorithmische Geometrie
• CAD
• CAM
• Computergrafik
• Partition
• Robotik
• Triangulation
• algorithms
• computational geometry
• computer graphics
• computer-aided design (CAD)
• computer-aided manufacturing (CAM)
• geometry
• linear optimization
• robotics
• complexity

• Department of Computer Science, Utrecht University, TB Utrecht, The Netherlands

  Mark Berg, Marc Kreveld, Mark Overmars

• Department of Computer Science, Pohang University of Science and Technology, Hyoya-Dong, Pohang, South Korea

  Otfried Schwarzkopf

Policies and ethics