A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (Q638566): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:20, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) |
scientific article |
Statements
A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (English)
0 references
12 September 2011
0 references
Freeman code
0 references
lattice paths
0 references
self-intersection
0 references
radix tree
0 references
