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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computer graphics forum Jg. 39; H. 2; S. 325 - 334
Hauptverfasser:	Trettner, P., Kobbelt, L.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford Blackwell Publishing Ltd 01.05.2020
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!