Finding an approximate minimum-link visibility path inside a simple polygon (Q672401): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(95)00072-k / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997350911 / rank | |||
Normal rank | |||
Latest revision as of 09:22, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding an approximate minimum-link visibility path inside a simple polygon |
scientific article |
Statements
Finding an approximate minimum-link visibility path inside a simple polygon (English)
0 references
28 February 1997
0 references
computational geometry
0 references
approximation algorithms
0 references
simple polygon
0 references
visibility path
0 references
minimum link path
0 references
