Application of longest common subsequence algorithms to meshing of planar domains with quadrilaterals

DOI10.1007/978-3-319-67885-6_16MaRDI QIDQ1690343zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Petra Surynková, Pavel Surynek

Publication date 19 January 2018

Full work available at URL https://doi.org/10.1007/978-3-319-67885-6_16

zbMATH Keywords

\(n\)-sided planar regionlongest common subsequenceoptimal meshquadrilateral meshquadrilaterals

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Blossom-Quad: a non-uniform quadrilateral mesh generator using a minimum-cost perfect-matching algorithm
• Longest-edge \(n\)-section algorithms: properties and open problems
• HIGH QUALITY QUADRILATERAL SURFACE MESHING WITHOUT TEMPLATE RESTRICTIONS: A NEW APPROACH BASED ON NETWORK FLOW TECHNIQUES
• The cut \&{} glue mesh generation algorithm
• HIGH FIDELITY INTERVAL ASSIGNMENT

Cited in

(1)

• Simon's congruence pattern matching

This page was built for publication: Application of longest common subsequence algorithms to meshing of planar domains with quadrilaterals

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