Pages that link to "Item:Q1003721"
From MaRDI portal
The following pages link to Minimum decomposition of a digital surface into digital plane segments is NP-hard (Q1003721):
Displaying 4 items.
- Some theoretical challenges in digital geometry: a perspective (Q967394) (← links)
- Maximal Planes and Multiscale Tangential Cover of 3D Digital Objects (Q3003529) (← links)
- Close-to-optimal algorithm for rectangular decomposition of 3D shapes (Q5218999) (← links)
- An alternative definition for digital convexity (Q5925581) (← links)