13 search results - page 1 / 3 » Two Linear-Time Algorithms for Computing the Minimum Length ... |
DGCI
2009
Springer
13 years 7 months ago
2009
Springer
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
PAMI
2002
13 years 4 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 ...
ISVC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This paper presents a straightforward top-down segmentation method based on a contour approach on histological images. Our approach relies on a digital deformable model w...
ICPR
2000
IEEE
14 years 5 months ago
2000
IEEE
This paper compares two techniques for measuring the length of a digital curve. Both techniques (digital straight segment approximation, minimum length polygon) are known to be co...
IWVF
2001
Springer
13 years 9 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...