Drawing unordered trees on \(k\)-grids (Q4910555)
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 6146099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Drawing unordered trees on \(k\)-grids |
scientific article; zbMATH DE number 6146099 |
Statements
Drawing Unordered Trees on k-Grids (English)
0 references
19 March 2013
0 references
drawing trees
0 references
orthogonal grid
0 references
octagonal grid
0 references
hexagonal grid
0 references
ternary trees
0 references
upper bound
0 references
unit edge length
0 references
area complexity
0 references
drawing unordered trees
0 references
0.9910037517547609
0 references
0.8967788815498352
0 references
0.8498755693435669
0 references
0.8331471681594849
0 references
0.8212825655937195
0 references
