Practical quad mesh simplification
| dc.contributor.author | Tarini, Marco | en_US |
| dc.contributor.author | Pietroni, Nico | en_US |
| dc.contributor.author | Cignoni, Paolo | en_US |
| dc.contributor.author | Panozzo, Daniele | en_US |
| dc.contributor.author | Puppo, Enrico | en_US |
| dc.date.accessioned | 2015-02-23T16:40:50Z | |
| dc.date.available | 2015-02-23T16:40:50Z | |
| dc.date.issued | 2010 | en_US |
| dc.description.abstract | In this paper we present an innovative approach to incremental quad mesh simplification, i.e. the task of producing a low complexity quad mesh starting from a high complexity one. The process is based on a novel set of strictly local operations which preserve quad structure. We show how good tessellation quality (e.g. in terms of vertex valencies) can be achieved by pursuing uniform length and canonical proportions of edges and diagonals. The decimation process is interleaved with smoothing in tangent space. The latter strongly contributes to identify a suitable sequence of local modification operations. The method is naturally extended to manage preservation of feature lines (e.g. creases) and varying (e.g. adaptive) tessellation densities. We also present an original Triangle-to-Quad conversion algorithm that behaves well in terms of geometrical complexity and tessellation quality, which we use to obtain the initial quad mesh from a given triangle mesh. | en_US |
| dc.description.number | 2 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 29 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.2009.01610.x | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 407-418 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2009.01610.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd | en_US |
| dc.title | Practical quad mesh simplification | en_US |