A compact chord property for digital arcs

@article{Sharaiha1993ACC,
  title={A compact chord property for digital arcs},
  author={Yazid M. Sharaiha and Philippe Garat},
  journal={Pattern Recognition},
  year={1993},
  volume={26},
  pages={799-803}
}
Abstract Rosenfeld ( IEEE Trans. Comput. C-23 (12), 1264–1269 (1974)) defined the chord property and proved that a digital arc is a digital straight segment if and only if it satisfies the chord property. A new property is defined, which we call the compact chord property, and the two properties are proved to be equivalent. The compact chord property offers a useful alternative for testing a digital arc for straightness by exploiting the notion of visibility in computational geometry. 
BETA

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

A Bibliography on Digital and Computational Convexity (1961-1988)

  • IEEE Trans. Pattern Anal. Mach. Intell.
  • 1989
VIEW 1 EXCERPT

Digital straight segments

  • Computer Vision, Graphics, and Image Processing
  • 1986

On the straightness of digital arcs

S.H.Y. Hung
  • IEEE Trans. Pattern Analysis Mach. Intell
  • 1985

Discrete Representation of Straight Lines

  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 1984
VIEW 1 EXCERPT

definitions, parametrization and compatibility with continuous convexity, Comput

A. Rosenfeld, Digital topology, +21 authors Discrete convexity
  • Vision Graphics Image Process. 21, 326-344
  • 1983

Digital Straight Lines and Convexity of Digital Regions

  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 1982

On the Cellular Convexity of Complexes

  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 1981

Computer processing of line-drawing images, Computing Surveys

H. Freeman
  • 1974
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…