A period on digital line segments is defined. It is shown that each of the two nearest supports contains a preimage of the digital line segment and at least one of them contains two points of the digital line segment. Linear time algorithms are presented which find the nearest support of a 2-D digit
A simple proof of Rosenfeld's characterization of digital straight line segments
โ Scribed by Christian Ronse
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 294 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0167-8655
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
quirement, in addition to the high cost of equipment. Thus, it is important to develop machine vision techniques for This paper presents a procedure for segmenting planar curves, mainly the projected boundary contours of machined automated recognition and inspection of 3-D objects (espeparts, into s
The antipodal graph A(G) of a graph G is defined as the graph on the same vertex set as G with two vertices being adjacent in A(G) if the distance between them in G is the diameter of G. (If G is disconnected then we define &am(G) = co.) Aravamudhan and Rajendran [l, 21 gave the following character