Cost Minimizing Local Anisotropic Quad Mesh Refinement
| dc.contributor.author | Lyon, Max | en_US |
| dc.contributor.author | Bommes, David | en_US |
| dc.contributor.author | Kobbelt, Leif | en_US |
| dc.contributor.editor | Jacobson, Alec and Huang, Qixing | en_US |
| dc.date.accessioned | 2020-07-05T13:26:15Z | |
| dc.date.available | 2020-07-05T13:26:15Z | |
| dc.date.issued | 2020 | |
| dc.description.abstract | Quad meshes as a surface representation have many conceptual advantages over triangle meshes. Their edges can naturally be aligned to principal curvatures of the underlying surface and they have the flexibility to create strongly anisotropic cells without causing excessively small inner angles. While in recent years a lot of progress has been made towards generating high quality uniform quad meshes for arbitrary shapes, their adaptive and anisotropic refinement remains difficult since a single edge split might propagate across the entire surface in order to maintain consistency. In this paper we present a novel refinement technique which finds the optimal trade-off between number of resulting elements and inserted singularities according to a user prescribed weighting. Our algorithm takes as input a quad mesh with those edges tagged that are prescribed to be refined. It then formulates a binary optimization problem that minimizes the number of additional edges which need to be split in order to maintain consistency. Valence 3 and 5 singularities have to be introduced in the transition region between refined and unrefined regions of the mesh. The optimization hence computes the optimal trade-off and places singularities strategically in order to minimize the number of consistency splits —- or avoids singularities where this causes only a small number of additional splits. When applying the refinement scheme iteratively, we extend our binary optimization formulation such that previous splits can be undone if this prevents degenerate cells with small inner angles that otherwise might occur in anisotropic regions or in the vicinity of singularities. We demonstrate on a number of challenging examples that the algorithm performs well in practice. | en_US |
| dc.description.number | 5 | |
| dc.description.sectionheaders | Meshing | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 39 | |
| dc.identifier.doi | 10.1111/cgf.14076 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 163-172 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.14076 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf14076 | |
| dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.rights | Attribution 4.0 International License | |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | Computing methodologies | |
| dc.subject | Mesh models | |
| dc.subject | Mesh geometry models | |
| dc.title | Cost Minimizing Local Anisotropic Quad Mesh Refinement | en_US |