An efficient exhaustive search algorithm for the Escherization problem (Q2196607)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient exhaustive search algorithm for the Escherization problem |
scientific article; zbMATH DE number 7243304
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient exhaustive search algorithm for the Escherization problem |
scientific article; zbMATH DE number 7243304 |
Statements
An efficient exhaustive search algorithm for the Escherization problem (English)
0 references
3 September 2020
0 references
Escherization
0 references
Escher-like tiling
0 references
tessellation
0 references
procrustes distance
0 references
isohedral tiling
0 references
0.8624032735824585
0 references
0.8378530144691467
0 references
0.7008470892906189
0 references
0.6864152550697327
0 references
