Finding a minimum medial axis of a discrete shape is NP-hard (Q952462)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding a minimum medial axis of a discrete shape is NP-hard |
scientific article; zbMATH DE number 5365100
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a minimum medial axis of a discrete shape is NP-hard |
scientific article; zbMATH DE number 5365100 |
Statements
Finding a minimum medial axis of a discrete shape is NP-hard (English)
0 references
12 November 2008
0 references
minimum medial axis
0 references
NP-completeness
0 references
bounded approximation algorithm
0 references
0 references
