Selecting the Best Quadrilateral Mesh for Given Planar Shape

TL;DR

This paper presents a method for selecting the optimal quadrilateral mesh for a given planar shape by matching it with a catalogue using a longest common subsequence approach, aiding in shape parametrization.

Contribution

It introduces a novel mesh matching technique based on LCS for selecting the best quadrilateral mesh from a catalogue for planar regions.

Findings

The method effectively matches shapes to meshes.

The approach provides a foundation for shape parametrization.

It demonstrates viability for mesh selection in planar regions.

Abstract

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.