Quantum information processing exploits the quantum nature of information. It offers
fundamentally new solutions in the field of computer science and extends the possibilities to …

Computational geometry is concerned with the design and analysis of algorithms for
geometrical problems. In addition, other more practically oriented, areas of computer …

TetGen® is a C++ program for generating good quality tetrahedral meshes aimed to support
numerical methods and scientific computing [Hang Si] 1. The problem of quality tetrahedral …

This well-accepted introduction to computational geometry is a textbook for high-level
undergraduate and low-level graduate courses. The focus is on algorithms and hence the …

The convex hull of a set of points is the smallest convex set that contains the points. This
article presents a practical convex hull algorithm that combines the two-dimensional …

The study of algorithms for generating unstructured meshes of triangles and tetrahedra
began with mechanical and aeronautical engineers who decompose physical domains into …

This is the newly revised and expanded edition of the popular introduction to the design and
implementation of geometry algorithms arising in areas such as computer graphics, robotics …

This book is primarily a textbook introduction to various areas of discrete geometry. In each
area, it explains several key results and methods, in an accessible and concrete manner. It …

Delaunay refinement is a technique for generating unstructured meshes of triangles for use
in interpolation, the finite element method, and the finite volume method. In theory and …

The topic of this chapter, Voronoi diagrams, differs from other areas of computational
geometry, in that its origin dates back to the 17th century. In his book on the principles of …