2 search results - page 1 / 1 » Minimal Decomposition of a Digital Surface into Digital Plan... |
DGCI
2006
Springer
13 years 8 months ago
2006
Springer
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
IVC
2007
13 years 4 months ago
2007
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal c...