Optimal base complexes for quadrilateral meshes

DOI10.1016/J.CAGD.2017.02.012MaRDI QIDQ2357692zbMATH OpenOpenAlexFDO

Authors 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

algorithmbase domainbinary optimizationgraph matchingquad layoutsquadrilateral meshes

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)

Recommendations

• Quadrilateral mesh generation. I: Metric based method
• HIGH QUALITY QUADRILATERAL SURFACE MESHING WITHOUT TEMPLATE RESTRICTIONS: A NEW APPROACH BASED ON NETWORK FLOW TECHNIQUES
• CONSTRAINED QUADRILATERAL MESHES OF BOUNDED SIZE
• Blossom-Quad: a non-uniform quadrilateral mesh generator using a minimum-cost perfect-matching algorithm
• On optimal bilinear quadrilateral meshes

Cites work

• Integer-grid maps for reliable quad meshing
• Level-of-detail quad meshing
• Paths, trees and matchings under disjunctive constraints
• QuadCover -- surface parameterization using branched coverings
• The minimum cost perfect matching problem with conflict pair constraints

Cited in

(2)

• Computing IGA-suitable planar parameterizations by polysquare-enhanced domain partition
• scientific article; zbMATH DE number 5882285 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357692)