Show simple item record

dc.contributor.authorMichaud, Célineen_US
dc.contributor.authorMellado, Nicolasen_US
dc.contributor.authorPaulin, Mathiasen_US
dc.contributor.editorPierre Benard and Daniel Sykoraen_US
dc.date.accessioned2017-04-22T16:43:37Z
dc.date.available2017-04-22T16:43:37Z
dc.date.issued2017
dc.identifier.issn1017-4656
dc.identifier.urihttp://dx.doi.org/10.2312/egp.20171040
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/egp20171040
dc.description.abstractProgressive 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.en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectI.3.5 [Computer Graphics]
dc.subjectComputational Geometry and Object Modeling
dc.subjectCurve
dc.subjectsurface
dc.subjectsolid
dc.subjectand object representations
dc.titleMesh SimplificationWith Curvature Error Metricen_US
dc.description.seriesinformationEG 2017 - Posters
dc.description.sectionheadersPosters
dc.identifier.doi10.2312/egp.20171040
dc.identifier.pages11-12


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record