Reliable feature-line driven quad-remeshing

Abstract

We present a new algorithm for the semi-regular quadrangulation of an input surface, driven by its line features, such as sharp creases. We define a perfectly feature-aligned cross-field and a coarse layout of polygonal-shaped patches where we strictly ensure that all the feature-lines are represented as patch boundaries. To be able to consistently do so, we allow non-quadrilateral patches and T-junctions in the layout; the key is the ability to constrain the layout so that it still admits a globally consistent, T-junction-free, and pure-quad internal tessellation of its patches.

Hex-Mesh Generation and Processing: a Survey

“…In recent years the computer graphics community has released multiple databases that have been extremely useful for practitioners in the field, raising the bar for new algorithms in terms of scalability and ability to handle a variety of inputs with different complexity, from easy ones to highly challenging. To make a practical example, the Thingi10K dataset has quickly become a popular means to empirically validate the robustness of surface mesh generation and processing algorithms Pietroni et al 2021] and some of its models are so pathological that being able to process them is an achievement by itself, with authors reporting both running times and memory consumption (see e.g. Fig.…”