Abstract We introduce a class of planar arcs and curves, called tame arcs, which is general enough to describe (parts of) the boundaries of planar real objects. A tame arc can have smooth parts as well as sharp (non-differentiable) corners; thus a polygonal arc is tame. On the other hand, this class of arcs is restrictive enough to rule out pathological arcs which have infinitely many inflections or which turn infinitely often: A tame arc can have only finitely many inflections, and its total absolute turn must be finite. In order to relate boundary properties of discrete objects obtained by segmenting digital images to the corresponding properties of their continuous originals, the theory of tame arcs is based on concepts that can be directly transferred from the continuous to the discrete domain. A tame arc is composed of a finite number of supported arcs. We define supported digital arcs and motivate their definition by the fact that they can be obtained by digitizing continuous supported arcs. Every digital arc is tame, since it contains a finite number of points, and therefore it can be decomposed into a finite number of supported digital arcs.
[1]
C. Carathéodory.
Über den Variabilitätsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen
,
1907
.
[2]
J. Dieudonne,et al.
Encyclopedic Dictionary of Mathematics
,
1979
.
[3]
M. Spivak.
A comprehensive introduction to differential geometry
,
1979
.
[4]
Rolf Klein,et al.
Algorithmische Geometrie
,
1997
.
[5]
丸山 徹.
Convex Analysisの二,三の進展について
,
1977
.
[6]
H. Minkowski,et al.
Geometrie der Zahlen
,
1896
.
[7]
F. A. Valentine.
A three point convexity property
,
1957
.
[8]
Karl Menger,et al.
Some Applications of Point-Set Methods
,
1931
.
[9]
Azriel Rosenfeld,et al.
Differentialless geometry of plane curves
,
1997,
Optics & Photonics.
[10]
日本数学会,et al.
Encyclopedic dictionary of mathematics
,
1993
.
[11]
Azriel Rosenfeld,et al.
Generalized convexity: CP3 and boundaries of convex sets
,
1995,
Pattern Recognit..