Minimum decomposition of a digital surface into digital plane segments is NP-hard (Q1003721)
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: Minimum decomposition of a digital surface into digital plane segments is NP-hard |
scientific article; zbMATH DE number 5523188
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum decomposition of a digital surface into digital plane segments is NP-hard |
scientific article; zbMATH DE number 5523188 |
Statements
Minimum decomposition of a digital surface into digital plane segments is NP-hard (English)
0 references
4 March 2009
0 references
digital object
0 references
digital plane
0 references
decomposition
0 references
complexity
0 references
0 references
