• DocumentCode
    1119200
  • Title

    Convex Digital Solids

  • Author

    Kim, Chul E. ; Rosenfeld, Azriel

  • Author_Institution
    Department of Computer Science, University of Maryland, College Park, MD 20742; Department of Computer Science, Washington State University, Pullman, WA 99164.
  • Issue
    6
  • fYear
    1982
  • Firstpage
    612
  • Lastpage
    618
  • Abstract
    A definition of convexity of digital solids is introduced. Then it is proved that a digital solid is convex if and only if it has the chordal triangle property. Other geometric properties which characterize convex digital regions are shown to be only necessary, but not sufficient, conditions for a digital solid to be convex. An efficient algorithm that determines whether or not a digital solid is convex is presented.
  • Keywords
    Chordal triangle property; chord property; digital convexity; digital solid; efficient algorithm; half-cell expansion; semidigital point;
  • fLanguage
    English
  • Journal_Title
    Pattern Analysis and Machine Intelligence, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0162-8828
  • Type

    jour

  • DOI
    10.1109/TPAMI.1982.4767314
  • Filename
    4767314
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1119200