Selecting the Best Quadrilateral Mesh for Given Planar Shape

10/31/2016
by   Petra Surynkova, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2020

A Manifold of Planar Triangular Meshes with Complete Riemannian Metric

Shape spaces are fundamental in a variety of applications including imag...
research
04/21/2019

Snaxels on a Plane

While many algorithms exist for tracing various contours for illustratin...
research
03/02/2021

VEM and the Mesh

In this work we report some results, obtained within the framework of th...
research
12/25/2012

Discrete Surface Modeling Based on Google Earth: A Case Study

Google Earth (GE) has become a powerful tool for geological, geophysical...
research
12/06/2021

Region extraction in mesh intersection

Region extraction is a very common task in both Computer Science and Eng...
research
12/19/2022

PullupStructs: Digital Fabrication for Folding Structures via Pull-up Nets

In this paper, we introduce a method to rapidly create 3D geometries by ...
research
05/06/2021

PH-CPF: Planar Hexagonal Meshing using Coordinate Power Fields

We present a new approach for computing planar hexagonal meshes that app...

Please sign up or login with your details

Forgot password? Click here to reset