• Corpus ID: 229297570

The Quad Layout Immersion: A Mathematically Equivalent Representation of a Surface Quadrilateral Layout

@article{Shepherd2020TheQL,
  title={The Quad Layout Immersion: A Mathematically Equivalent Representation of a Surface Quadrilateral Layout},
  author={Kendrick M. Shepherd and Ren{\'e} R. Hiemstra and Thomas J. R. Hughes},
  journal={ArXiv},
  year={2020},
  volume={abs/2012.09368}
}
Quadrilateral layouts on surfaces are valuable in texture mapping, and essential in generation of quadrilateral meshes and in fitting splines. Previous work has characterized such layouts as a special metric on a surface or as a meromorphic quartic differential with finite trajectories. In this work, a surface quadrilateral layout is alternatively characterized as a special immersion of a cut representation of the surface into the Euclidean plane. We call this a quad layout immersion. This… 

Quadrilateral layout generation and optimization using equivalence classes of integral curves: theory and application to surfaces with boundaries

TLDR
This work rigorously characterize curves in a quadrilateral layout up to homotopy type and uses this information to quickly define high-quality connectivity constraints between singular nodes.

ISOGEOMETRIC ANALYSIS-SUITABLE RECONSTRUCTION OF 1996 DODGE NEON USING RICCI FLOW WITH METRIC OPTIMIZATION

TLDR
New theory and tools from computational geometry are integrated into a framework suitable for reconstructing industrially-relevant models and demonstrated by reconstructing the chassis of a 1996 Dodge Neon and using the reconstructed splines as input for isogeometric modal analysis in LS-DYNA.

References

SHOWING 1-10 OF 46 REFERENCES

Designing quadrangulations with discrete harmonic forms

TLDR
This work introduces a framework for quadrangle meshing of discrete manifolds that hinges on extending the discrete Laplacian operator to allow for line singularities and singularities with fractional indices to considerably increase the design flexibility of quad meshing.

Quad Layout Embedding via Aligned Parameterization

TLDR
A novel quad layout algorithm that focuses on the embedding optimization, thereby complementing recent methods focusing on the structure optimization aspect and being suited for fully automatic workflows.

Mixed-integer quadrangulation

TLDR
A novel method for quadrangulating a given triangle mesh by constructing an as smooth as possible symmetric cross field satisfying a sparse set of directional constraints and computed a seamless globally smooth parametrization whose iso-parameter lines follow the cross field directions.

Quadrilateral mesh generation I : Metric based method

Seamless Parametrization with Arbitrary Cones for Arbitrary Genus

TLDR
It is demonstrated that for arbitrary given sets of topologically admissible parametric cones with prescribed curvature, a global seamless parametrization always exists (with the exception of one well-known case).

Integer-grid maps for reliable quad meshing

TLDR
A novel convex Mixed-Integer Quadratic Programming (MIQP) formulation which ensures by construction that the resulting map is within the class of so called Integer-Grid Maps that are guaranteed to imply a quad mesh.

Bijective parameterization with free boundaries

We present a fully automatic method for generating guaranteed bijective surface parameterizations from triangulated 3D surfaces partitioned into charts. We do so by using a distortion metric that

Geometric optimization via composite majorization

TLDR
This work proposes a second order optimization approach that exploits this composite structure to efficiently converge to a local minimum, and utilizes a tight convex majorizer of the energy, which it employs as a convex second order approximation of the objective function.

Are Bilinear Quadrilaterals Better Than Linear Triangles

This paper compares the theoretical effectiveness of bilinear approximation over quadrilaterals with linear approximation over triangles. Anisotropic mesh transformation is used to generate

Coarse Quad Layouts Through Robust Simplification of Cross Field Separatrix Partitions

TLDR
An efficient method to compute high-quality cross fields on curved surfaces by extending the diffusion generated method from Viertel and Osting and a robust method to produce coarse quad layouts by simplifying the partitions obtained via naive separatrix tracing are introduced.