Finding minimum rectilinear distance paths in the presence of barriers (Q3910336): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230110307 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062367161 / rank | |||
Normal rank | |||
Latest revision as of 21:36, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding minimum rectilinear distance paths in the presence of barriers |
scientific article |
Statements
Finding minimum rectilinear distance paths in the presence of barriers (English)
0 references
1981
0 references
minimum rectilinear distance paths
0 references
presence of barriers
0 references
polygonal barriers
0 references
efficient algorithm
0 references
Dijkstra-type iteration
0 references
computational complexity
0 references
