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

Original language | English (US) |
---|---|

Pages (from-to) | 407-418 |

Number of pages | 12 |

Journal | Computer Graphics Forum |

Volume | 29 |

Issue number | 2 |

DOIs | |

State | Published - May 2010 |

### Keywords

- Mesh-simplification
- Quad-meshes

### ASJC Scopus subject areas

- Computer Networks and Communications

### Cite this

*Computer Graphics Forum*,

*29*(2), 407-418. https://doi.org/10.1111/j.1467-8659.2009.01610.x

**Practical quad mesh simplification.** / Tarini, Marco; Pietroni, Nico; Cignoni, Paolo; Panozzo, Daniele; Puppo, Enrico.

Research output: Contribution to journal › Article

*Computer Graphics Forum*, vol. 29, no. 2, pp. 407-418. https://doi.org/10.1111/j.1467-8659.2009.01610.x

}

TY - JOUR

T1 - Practical quad mesh simplification

AU - Tarini, Marco

AU - Pietroni, Nico

AU - Cignoni, Paolo

AU - Panozzo, Daniele

AU - Puppo, Enrico

PY - 2010/5

Y1 - 2010/5

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

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

KW - Mesh-simplification

KW - Quad-meshes

UR - http://www.scopus.com/inward/record.url?scp=77952812118&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77952812118&partnerID=8YFLogxK

U2 - 10.1111/j.1467-8659.2009.01610.x

DO - 10.1111/j.1467-8659.2009.01610.x

M3 - Article

VL - 29

SP - 407

EP - 418

JO - Computer Graphics Forum

JF - Computer Graphics Forum

SN - 0167-7055

IS - 2

ER -