2021
DOI: 10.1145/3450626.3459941
|View full text |Cite
|
Sign up to set email alerts
|

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 consisten… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
10
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 35 publications
(11 citation statements)
references
References 41 publications
1
10
0
Order By: Relevance
“…When compared with Pietroni et al. [PNA*21] (see Figure 17), the overall quality is also very similar, except that our method produces simpler configurations because it does not produce singularities that are not present in the input frame field. Our algorithm works well on models with thin features Figure 18 that are known to be difficult to quantize.…”
Section: Resultssupporting
confidence: 54%
See 1 more Smart Citation
“…When compared with Pietroni et al. [PNA*21] (see Figure 17), the overall quality is also very similar, except that our method produces simpler configurations because it does not produce singularities that are not present in the input frame field. Our algorithm works well on models with thin features Figure 18 that are known to be difficult to quantize.…”
Section: Resultssupporting
confidence: 54%
“…A quad mesh (blue) extracted from a grid preserving map has the singularities of the input frame field. Introducing extra singularities [PNA*21] (green) increases the robustness, at the expense of producing more complex structures.…”
Section: Resultsmentioning
confidence: 99%
“…When HexBox is used as a remeshing tool, projection is used to displace the vertices of the hexmesh so as to match the input target geometry. Our projection algorithm takes inspiration from the quad reprojection method of QuadWild [PNA*21], in the sense that it uses an inverse projection operator to approximate the target geometry well. In short, rather than projecting the hexmesh vertices directly to the target geometry, we do the opposite, projecting the target geometry to the modelled shape and using the so generated vectors to devise per‐vertex displacements for the hexmesh surface points.…”
Section: Anatomy Of Hexboxmentioning
confidence: 99%
“…They are efficient but contain ill-posed cases with results depending on the implementation. Instead, the general idea of global remeshing [2,14,36,48] is to define a directional field as constraint boundary conditions on a Poisson equation, and then minimize an artificial energy function. After minimization, a new target mesh can be reconstructed from scratch using the solved solution.…”
Section: Polygon Reduction In Geometry Processingmentioning
confidence: 99%