Polygon Mesh Processing
Auteurs : Botsch Mario, Kobbelt Leif, Pauly Mark, Alliez Pierre, Levy Bruno
Geometry processing, or mesh processing, is a fast-growing area of research that uses concepts from applied mathematics, computer science, and engineering to design efficient algorithms for the acquisition, reconstruction, analysis, manipulation, simulation, and transmission of complex 3D models. Applications of geometry processing algorithms already cover a wide range of areas from multimedia, entertainment, and classical computer-aided design, to biomedical computing, reverse engineering, and scientific computing.
Over the last several years, triangle meshes have become increasingly popular, as irregular triangle meshes have developed into a valuable alternative to traditional spline surfaces. This book discusses the whole geometry processing pipeline based on triangle meshes. The pipeline starts with data input, for example, a model acquired by 3D scanning techniques. This data can then go through processes of error removal, mesh creation, smoothing, conversion, morphing, and more. The authors detail techniques for those processes using triangle meshes.
A supplemental website contains downloads and additional information.
Surface Representations
Mesh Data Structures
Differential Geometry
Smoothing
Parameterization
Remeshing
Simplification & Approximation
Model Repair
Deformation
Numerics
Leif Kobbelt is a professor of Computer Graphics & Multimedia at RWTH Aachen University in Germany. Mario Botsch is a professor of Computer Science at Bielefeld University and leads the Computer Graphics & Geometry Processing Group. Mark Pauly is an assistant professor in the computer science department of ETH Zurich, Switzerland. Pierre Alliez is a researcher in Computer Science at INRIA Sophia-Antipolis, in the GEOMETRICA group. Bruno Lvy is a senior researcher in INRIA-NGE, and a member of the LORIA lab. He is the scientific head of the ALICE project team.
Date de parution : 01-2011
15.2x22.9 cm
Thème de Polygon Mesh Processing :
Mots-clés :
Triangle Mesh; Laplace Beltrami Operator; Mario Botsch; Euler Lagrange Equation; Leif Kobbelt; Vertex Positions; Mark Pauly; Centroidal Voronoi Tessellation; Pierre Alliez; Input Mesh; Bruno Levy; Remeshing Algorithms; Mesh Processing; BSP Tree; 3-D models; Displacement Vectors; Voronoi Diagram; Elementary Circles; Edge Collapse; Regions Ri; Marching Cubes; Restricted Delaunay Triangulation; Voronoi Cells; Multi-scale Technique; Discrete Differential Operators; Implicit Surface; Hausdorff Distance; Anisotropic Areas; Mesh Data Structures; Triangle Ti; Tangent Vector; Vertex Clustering