Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals
2017
Abstrakt
The problem of mesh matching is addressed in this work. For a given n-sided planar region bounded by one loop of n polylines we are selecting optimal quadrilateral mesh from existing catalogue of meshes.
The formulation of matching between planar shape and quadrilateral mesh from the catalogue is based on the problem of finding longest common subsequence (LCS). Theoretical foundation of mesh matching method is provided.
Suggested method represents a viable technique for selecting best mesh for planar region and stepping stone for further parametrization of the region.