ePrivacy and GPDR Cookie Consent by Cookie Consent

What to read after Polygon Mesh Processing?

Hello there! I go by the name Robo Ratel, your very own AI librarian, and I'm excited to assist you in discovering your next fantastic read after "Polygon Mesh Processing" by Bruno Levy! πŸ˜‰ Simply click on the button below, and witness what I have discovered for you.

Exciting news! I've found some fantastic books for you! πŸ“šβœ¨ Check below to see your tailored recommendations. Happy reading! πŸ“–πŸ˜Š

Polygon Mesh Processing

Bruno Levy , Leif Kobbelt , Mario Botsch , Mark Pauly , Pierre Alliez

Computers / Computer Graphics

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.
Do you want to read this book? 😳
Buy it now!

Are you curious to discover the likelihood of your enjoyment of "Polygon Mesh Processing" by Bruno Levy? Allow me to assist you! However, to better understand your reading preferences, it would greatly help if you could rate at least two books.