E2397

Discrete straight line segments: parameters, primitives, and properties

“…(3.29) is not new. It was given in [Brons 1974], and proved in [Wu 1982]. Recently, a new structural algorithm was developed by [Castle & Pitteway 1986], using the palindromic structure inherent in straight strings.…”

“…[Rosenfeld 1974] introduces the chord property, and derives properties that can be used in a more exact formulation of Freeman's conditions. [Wu 1982] uses the recursive structure of the [Brons 1974] algorithm as a formulation of the linearity conditions, and shows that they are necessary and sufficient.…”

“…Independent of their connection to continuous straight line segments, straight strings can be characterized by means of the linearity conditions -these are the necessary and sufficient conditions a straight string has to satisfy in order to be (possibly) derived from a straight line segment IA in R . A first attempt at the formulation of these linearity conditions can be found in [Freeman 1970] , and a more exact version in [Brons 1974] .…”

“…It turns out that these runs themselves again appear in isolated runs, and in 'runs of runs', and so on, recursively. [Brons 1974]…”

“…In R . A first attempt at the formulation of these linearity conditions can be found in [Freeman 1970], and a more exact version in [Brons 1974].…”