On the Complexity of Nonconvex Covering (Q3740282): 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.1137/0215031 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2046559210 / rank | |||
Normal rank | |||
Latest revision as of 22:22, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Nonconvex Covering |
scientific article |
Statements
On the Complexity of Nonconvex Covering (English)
0 references
1986
0 references
NP-completeness
0 references
computational geometry
0 references
polynomial time algorithm
0 references
robotics
0 references
degree of nonconvexity
0 references
