Merging meshes is a recurrent need in geometry modeling and it is a critical step in the 3D acquisition pipeline, where it is used for building a single mesh from several range scans. A pioneering simple and effective solution to merging is represented by the Zippering algorithm (Turk and Levoy, 1994), which consists of simply stitching the meshes together along their borders. In this paper we propose a new extended version of the zippering algorithm that enables the user to control the resulting mesh by introducing quality criteria in the selection of redundant data, and allows to zip together meshes with different granularity by an ad hoc refinement algorithm.

Controlled and adaptive mesh zippering

Ganovelli F;Cignoni P;Scopigno R
2010

Abstract

Merging meshes is a recurrent need in geometry modeling and it is a critical step in the 3D acquisition pipeline, where it is used for building a single mesh from several range scans. A pioneering simple and effective solution to merging is represented by the Zippering algorithm (Turk and Levoy, 1994), which consists of simply stitching the meshes together along their borders. In this paper we propose a new extended version of the zippering algorithm that enables the user to control the resulting mesh by introducing quality criteria in the selection of redundant data, and allows to zip together meshes with different granularity by an ad hoc refinement algorithm.
2010
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
978-989-674-026-9
Computer Graphics
3D Graphics
File in questo prodotto:
File Dimensione Formato  
prod_92099-doc_28636.pdf

solo utenti autorizzati

Descrizione: Articolo Pubblicato
Tipologia: Versione Editoriale (PDF)
Dimensione 1.28 MB
Formato Adobe PDF
1.28 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
prod_92099-doc_37550.pdf

solo utenti autorizzati

Descrizione: Table of contents dei proceedings
Tipologia: Versione Editoriale (PDF)
Dimensione 172.85 kB
Formato Adobe PDF
172.85 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/63100
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 10
  • ???jsp.display-item.citation.isi??? ND
social impact