Fast and Robust QEF Minimization using Probabilistic Quadrics
| dc.contributor.author | Trettner, Philip | en_US |
| dc.contributor.author | Kobbelt, Leif | en_US |
| dc.contributor.editor | Panozzo, Daniele and Assarsson, Ulf | en_US |
| dc.date.accessioned | 2020-05-24T12:52:16Z | |
| dc.date.available | 2020-05-24T12:52:16Z | |
| dc.date.issued | 2020 | |
| dc.description.abstract | Error quadrics are a fundamental and powerful building block in many geometry processing algorithms. However, finding the minimizer of a given quadric is in many cases not robust and requires a singular value decomposition or some ad-hoc regularization. While classical error quadrics measure the squared deviation from a set of ground truth planes or polygons, we treat the input data as genuinely uncertain information and embed error quadrics in a probabilistic setting (''probabilistic quadrics'') where the optimal point minimizes the expected squared error. We derive closed form solutions for the popular plane and triangle quadrics subject to (spatially varying, anisotropic) Gaussian noise. Probabilistic quadrics can be minimized robustly by solving a simple linear system-50x faster than SVD. We show that probabilistic quadrics have superior properties in tasks like decimation and isosurface extraction since they favor more uniform triangulations and are more tolerant to noise while still maintaining feature sensitivity. A broad spectrum of applications can directly benefit from our new quadrics as a drop-in replacement which we demonstrate with mesh smoothing via filtered quadrics and non-linear subdivision surfaces. | en_US |
| dc.description.number | 2 | |
| dc.description.sectionheaders | Meshes and Subdivision | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 39 | |
| dc.identifier.doi | 10.1111/cgf.13933 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 325-334 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.13933 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf13933 | |
| dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.rights | Attribution 4.0 International License | |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | Computing methodologies | |
| dc.subject | Mesh models | |
| dc.subject | Mesh geometry models | |
| dc.title | Fast and Robust QEF Minimization using Probabilistic Quadrics | en_US |