A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (Q638566): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.019 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2120324771 / rank | |||
Normal rank | |||
Revision as of 02:18, 20 March 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
