Application of longest common subsequence algorithms to meshing of planar domains with quadrilaterals (Q1690343)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6827637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Application of longest common subsequence algorithms to meshing of planar domains with quadrilaterals |
scientific article; zbMATH DE number 6827637 |
Statements
Application of longest common subsequence algorithms to meshing of planar domains with quadrilaterals (English)
0 references
19 January 2018
0 references
quadrilaterals
0 references
quadrilateral mesh
0 references
optimal mesh
0 references
longest common subsequence
0 references
\(n\)-sided planar region
0 references
0.7027111649513245
0 references
0.6880919933319092
0 references
0.6848223805427551
0 references
0.6847593784332275
0 references
0.6837859749794006
0 references
