Fast and Robust QEF Minimization using Probabilistic Quadrics

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 squ...

Full description

Bibliographic Details

Published in:	Computer graphics forum Vol. 39; no. 2; pp. 325 - 334
Main Authors:	Trettner, P., Kobbelt, L.
Format:	Journal Article
Language:	English
Published:	Oxford Blackwell Publishing Ltd 01.05.2020
Subjects:	Algorithms CCS Concepts Computing methodologies → Mesh models; Mesh geometry models Error analysis Ground truth Normal distribution Optimization Random noise Regularization Robustness Singular value decomposition Triangles
ISSN:	0167-7055, 1467-8659
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!