A linear time algorithm for minimum link paths inside a simple polygon (Q3026389): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q247185 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Subhash Suri / rank | |||
Normal rank | |||
| 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.1016/0734-189x(86)90127-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001513095 / rank | |||
Normal rank | |||
Latest revision as of 10:31, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for minimum link paths inside a simple polygon |
scientific article |
Statements
A linear time algorithm for minimum link paths inside a simple polygon (English)
0 references
1986
0 references
polygonal path
0 references
minimum link path
0 references
efficient algorithm
0 references
