Guide to Computational Geometry Processing: Foundations, Algorithms, and MethodsSpringer Science & Business Media, 31 mai 2012 - 326 pages This book 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. 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 material at a supplementary website; includes self-study exercises throughout the text. |
Autres éditions - Tout afficher
Expressions et termes fréquents
a2h a2h affine space algorithm angle B-splines boundary cells Chap chapter circumcircle closest point Computational Geometry Processing Computer Graphics control points convex hull coordinates corresponding cube data structure defined Definition Delaunay triangulation denoted discrete discussed distance field domain edge flip eigenvalue eigenvectors Euclidean vector space Example Exercise face Gaußian curvature Geometry Processing given gradient Graph hyperplane implementation implicit surface inner product input interpolation intersection isosurface iterations kD tree knot vector Laplacian smoothing linear map Loop mean curvature metric space minimal NURBS obtain optimal parametrization patch planar plane point clouds point set polygonal mesh polynomial principal curvatures problem quadtree radial basis functions representation scans scheme Sect set of points shown in Fig simply solution spatial data model spline curve subdivision surfaces subset tangent Theorem triangle mesh u₁ valence Voronoi diagram voxel voxel grid zero дх