3D shape approximation and processing with implicitly defined surface primitives (Radial Basis Functions and more general kernel-based approximations, Partition of Unity approximations,Moving Least Squares, etc.) are currently a subject of intensive research in Geometric Modeling and Computer Graphics. In this paper, we propose an approach that combines two conflicting criteria: achieving a high approximation accuracy and obtaining an economical surface representation. We employ compactlysupported Radial Basis Functions and use Tikhonov Regularization to achieve a near optimal selection of their centers. An iterative approach, which defines a multi-level approximation, is used to cope with arising constrained optimization problems.
SIMS: a multi-level approach to surface reconstruction with sparse implicits
Giuseppe Patane'
2006
Abstract
3D shape approximation and processing with implicitly defined surface primitives (Radial Basis Functions and more general kernel-based approximations, Partition of Unity approximations,Moving Least Squares, etc.) are currently a subject of intensive research in Geometric Modeling and Computer Graphics. In this paper, we propose an approach that combines two conflicting criteria: achieving a high approximation accuracy and obtaining an economical surface representation. We employ compactlysupported Radial Basis Functions and use Tikhonov Regularization to achieve a near optimal selection of their centers. An iterative approach, which defines a multi-level approximation, is used to cope with arising constrained optimization problems.File | Dimensione | Formato | |
---|---|---|---|
prod_181600-doc_27694.pdf
solo utenti autorizzati
Descrizione: Copertina+Titolo+TOC+Prefazione
Dimensione
430.8 kB
Formato
Adobe PDF
|
430.8 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
prod_181600-doc_27922.pdf
solo utenti autorizzati
Descrizione: Articolo pubblicato
Dimensione
2.19 MB
Formato
Adobe PDF
|
2.19 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.