Optimal base complexes for quadrilateral meshes

DOI10.1016/j.cagd.2017.02.012zbMath1366.65044OpenAlexW2593621997MaRDI QIDQ2357692

Faniry H. Razafindrazaka, Konrad Polthier

Publication date: 14 June 2017

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cagd.2017.02.012

zbMATH Keywords

algorithmgraph matchingquadrilateral meshesbinary optimizationbase domainquad layouts

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items (1)

Computing IGA-suitable planar parameterizations by polysquare-enhanced domain partition

Cites Work

• The minimum cost perfect matching problem with conflict pair constraints
• Paths, trees and matchings under disjunctive constraints
• QuadCover ‐ Surface Parameterization using Branched Coverings
• Level-of-detail quad meshing
• Integer-grid maps for reliable quad meshing

This page was built for publication: Optimal base complexes for quadrilateral meshes