HIGH QUALITY QUADRILATERAL SURFACE MESHING WITHOUT TEMPLATE RESTRICTIONS: A NEW APPROACH BASED ON NETWORK FLOW TECHNIQUES
DOI10.1142/S0218195900000176zbMATH Open1074.65511OpenAlexW2055699080MaRDI QIDQ4682188FDOQ4682188
Authors: Matthias Müller-Hannemann
Publication date: 10 June 2005
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195900000176
Recommendations
mesh smoothingmesh decomposition\(b\)-matchingsbidirected flowsnon-manifold surfacesQuadrilateral surface meshes
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- A polynomial algorithm for b-matchings: An alternative approach
- Title not available (Why is that?)
- Finite element mesh generation methods: A review and classification
- Quadrilateral mesh generation in polygonal regions
- A new approach to the development of automatic quadrilateral mesh generation
- An analysis of alternative strategies for implementing matching algorithms
- Paving: A new approach to automated quadrilateral mesh generation
- Finite element mesh control by integer programming
- Mesh refinement via bidirected flows
Cited In (3)
This page was built for publication: HIGH QUALITY QUADRILATERAL SURFACE MESHING WITHOUT TEMPLATE RESTRICTIONS: A NEW APPROACH BASED ON NETWORK FLOW TECHNIQUES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682188)