Michaud, CélineMellado, NicolasPaulin, MathiasPierre Benard and Daniel Sykora2017-04-222017-04-2220171017-4656https://doi.org/10.2312/egp.20171040https://diglib.eg.org:443/handle/10.2312/egp20171040Progressive meshes algorithms aim at computing levels of detail from a highly detailed mesh. Many of these algorithms are based on a mesh decimation technique, generating coarse triangulation while optimizing for a particular metric which minimizes the distance to the original shape. However these metrics do not robustly handle high curvature regions, sharp features, boundaries or noise. We propose a novel error metric, based on algebraic spheres as a measure of the curvature of the mesh, to preserve curvature along the simplification process. This metric is compact, does not require extra input from the user, and is as simple to implement as a conventional quadric error metric.I.3.5 [Computer Graphics]Computational Geometry and Object ModelingCurvesurfacesolidand object representations10.2312/egp.2017104011-12