PAMI
2002
13 years 11 months ago
2002
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
IPCV
2008
14 years 26 days ago
2008
We propose one geometric algorithm to solve both the problem of circularity test and the problem of circularity measure. The former problem consists in deciding whether a given di...
ICPR
2000
IEEE
14 years 3 months ago
2000
IEEE
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
IWVF
2001
Springer
14 years 3 months ago
2001
Springer
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a mini...