Mark de Berg

Mark Overmars

Marc van Kreveld

Otfried Cheong

This introduction to computational geometry focuses on algorithms. Motivation is provided from the application areas as all techniques are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement.

Algorithms and Applications

Computational Geometry

Ulrich Meyer

This book constitutes the proceedings of the 18th Annual European Symposium on Algorithms, held in Liverpool, UK in September 2010.

18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings

Algorithms - ESA 2010

Marc van Krefeld

Algorithms -- ESA 2010, Part II

Computational geometry is the part of theoretical computer science that concerns itself with geometrical objects; it aims to define efficient algorithms for problems involving points, lines, polygons, and so on. The field has gained popularity very rapidly during the last decade. This is partly due to the many application areas of computational geometry and partly due to the beauty of the field itself. This monograph focuses on three problems that arise in three-dimensional computational geometry. The first problem is the ray shooting problem: preprocess a set of polyhedra into a data structure such that the first polyhedron that is hit by a query ray can be determined quickly. The second problem is that of computing depth orders: we want to sort a set of polyhedra such thatif one polyhedron is (partially) obscured by another polyhedron then it comes first in the order. The third problem is the hidden surface removal problem: given a set of polyhedra and a view point, compute which parts of the polyhedra are visible from the view point. These three problems involve issues that are fundamental to three-dimensional computational geometry. The book also contains a large introductory part discussing the techniques used to tackle the problems. This part should interest not only those who need the background for the rest of the book but also anyone who wants to know more about some recent techniques in computational geometry.

Ray Shooting, Depth Orders and Hidden Surface Removal

In this introduction to computational geometry the the text focuses on algorithms. All solutions and techniques described in the text are from computational geometry and are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.

Mark de Berg

About

Books

Join the club