Optical scanning is rapidly becoming ubiquitous. From industrial laser scanners to medical CT, MR and 3D ultrasound scanners, numerous organizations now have easy access to optical acquisition devices that provide huge volumes of image data. However, the raw geometry data acquired must first be processed before it is useful.This Guide to Computational Geometry Processing reviews the algorithms for processing geometric data, with a practical focus on important techniques not covered by traditional courses on computer vision and computer graphics. This is balanced with an introduction to the theoretical and mathematical underpinnings of each technique, enabling the reader to not only implement a given method, but also to understand the ideas behind it, its limitations and its advantages.Topics and features: presents an overview of the underlying mathematical theory, covering vector spaces, metric space, affine spaces, differential geometry, and finite difference methods for derivatives and differential equations; reviews geometry representations, including polygonal meshes, splines, and subdivision surfaces; examines techniques for computing curvature from polygonal meshes; describes algorithms for mesh smoothing, mesh parametrization, and mesh optimization and simplification; discusses point location databases and convex hulls of point sets; investigates the reconstruction of triangle meshes from point clouds, including methods for registration of point clouds and surface reconstruction; provides additional data, example programs and a programming library at a supplementary website; includes self-study exercises throughout the text.Graduate students will find this text a valuable, hands-on guide to developing key skills in geometry processing. The book will also serve as a useful reference for professionals wishing to improve their competency in this area.
