Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10371328" target="_blank" >RIV/00216208:11320/17:10371328 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-67885-6_16" target="_blank" >http://dx.doi.org/10.1007/978-3-319-67885-6_16</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-67885-6_16" target="_blank" >10.1007/978-3-319-67885-6_16</a>
Alternative languages
Result language
angličtina
Original language name
Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Lecture Notes in Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
10521
Issue of the periodical within the volume
October
Country of publishing house
GB - UNITED KINGDOM
Number of pages
16
Pages from-to
296-311
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-85032685431