Skip to main content

Computational Geometry

Algorithms and Applications

  • Textbook
  • © 2008
  • Latest edition


  • A broad overview of the major algorithms and data structures of the field
  • Motivated from applications
  • Covers concepts and techniquesto be presented in any course on computational geometry
  • Self-contained and illustrated with 370 figures
  • Additional online material available under
  • Besides revisions to the second edition, new sections discussing Voronoi diagrams of line segments, farthest-point Voronoi diagrams, and realistic input models have been added
  • Includes supplementary material:

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 16.99 USD 39.99
Discount applied Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

Computational geometry emerged from the ?eld of algorithms design and analysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The success of the ?eld 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 information 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 dif?cult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simpli?ed many of the previous approaches. In this textbook we have tried to make these modern 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.

Similar content being viewed by others


Table of contents (16 chapters)


"An excellent introduction to the field is given here, including a general motivation and usage cases beyond simple graphics rendering or interaction." from the ACM Reviews by William Fahle, University of Texas at Dallas, USA

Authors and Affiliations

  • Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands

    Mark Berg

  • Department of Computer Science, KAIST, Daejeon, Korea

    Otfried Cheong

  • Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands

    Marc Kreveld, Mark Overmars

Bibliographic Information

Publish with us