11 August 1995 Combinatorial pieces in digital lines and planes
Author Affiliations +
Abstract
In this paper we give an answer to the problem of enumerating the combinatorially distinct segments of given length in digital lines and rectangular blocks of given shape in digital planes. We also give a formula to locate a precise piece and study the distribution of all segments of digital lines. We deduce from these results a very simple algorithm to recognize the normal vector of a digital plane.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jean-Pierre Reveilles, Jean-Pierre Reveilles, } "Combinatorial pieces in digital lines and planes", Proc. SPIE 2573, Vision Geometry IV, (11 August 1995); doi: 10.1117/12.216425; https://doi.org/10.1117/12.216425
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

New AFCM clustering algorithm
Proceedings of SPIE (August 28 1995)
Text segmentation for automatic document processing
Proceedings of SPIE (January 07 1999)
Tracking of multiple objects under partial occlusion
Proceedings of SPIE (May 04 2009)
Document skew-angle detection algorithm
Proceedings of SPIE (August 27 1993)
Infrared image segmentation through iterative thresholding
Proceedings of SPIE (September 01 1990)

Back to Top