A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit <a rel="external noopener" href="https://diglib.eg.org/xmlui/bitstream/handle/10.2312/egt.20081055.T7/T7.pdf;jsessionid=DEF9F7E6C150F9D2D542FFD4FCE55687?sequence=1">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="The Eurographics Association">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xgoygnj3knbt3jsqqs5uay37ba" style="color: black;">Eurographics State of the Art Reports</a>
Polygonal meshes are nowadays intensively used in many different areas of computer graphics and geometry processing. In classical CAGD polygonal meshes developed into a valuable alternative to traditional spline surfaces, since their conceptual simplicity allows for more flexible and more efficient processing. Moreover, the consequent use of triangle meshes avoids error-prone conversions, e.g., the meshing of CAD surfaces for numerical simulations. Besides classical geometric modeling, other<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2312/egt.20081055">doi:10.2312/egt.20081055</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yypmklz4lvexpox3z6iinvwun4">fatcat:yypmklz4lvexpox3z6iinvwun4</a> </span>
more »... or areas frequently employing triangle meshes are computer games and movie production. In this context geometric models are often acquired by 3D scanning techniques and have to undergo post-processing and shape optimization before being actually used in production. The course starts with a comparison of different surface representations, motivating the use of polygonal meshes. We discuss the removal of geometric and topological degeneracies, and introduce quality measures for polygonal meshes, followed by their respective optimization, namely smoothing, decimation, and remeshing. We further discuss parametrization and present interactive shape editing, including a brief discussion on efficient numerical solvers. Since the course covers the whole mesh processing pipeline, it can give a full overview and point out interesting and important connections between the individual topics. For each topic we present the fundamental concepts and current state-of-the-art techniques. Frequent software demonstrations will give the participants a better understanding of the discussed algorithms. Moreover, these demo applications will be available from the course materials, both as binaries and in full source code, based on the popular mesh libraries OpenMesh and CGAL. This enables the participants to implement the discussed algorithms and reproduce the results published in the corresponding papers.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220119204132/https://diglib.eg.org/xmlui/bitstream/handle/10.2312/egt.20081055.T7/T7.pdf;jsessionid=DEF9F7E6C150F9D2D542FFD4FCE55687?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/32/d4/32d462be3fd6aa32809e42feb1959fab9530d428.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2312/egt.20081055"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>