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

Celý popis

Podrobná bibliografia

Vydané v:	Computer graphics forum Ročník 39; číslo 2; s. 325 - 334
Hlavní autori:	Trettner, P., Kobbelt, L.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Blackwell Publishing Ltd 01.05.2020
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!