Efficient operations on discrete paths (Q265059)
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 6561936
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient operations on discrete paths |
scientific article; zbMATH DE number 6561936 |
Statements
Efficient operations on discrete paths (English)
0 references
1 April 2016
0 references
Freeman code
0 references
lattice paths
0 references
radix tree
0 references
discrete sets
0 references
outer hull
0 references
convex hull
0 references
polyomino intersection
0 references
union
0 references
complement
0 references
difference
0 references
0.8368535041809082
0 references
0.7651691436767578
0 references
0.7480655312538147
0 references
0.7383260726928711
0 references
0.70228111743927
0 references
