• DocumentCode
    1119620
  • Title

    Segmenting Dot Patterns by Voronoi Diagram Concavity

  • Author

    Fairfield, John

  • Author_Institution
    Department of Mathematics and Computer Science, James Madison University, Harrisonburg, VA 22807.
  • Issue
    1
  • fYear
    1983
  • Firstpage
    104
  • Lastpage
    110
  • Abstract
    This correspondence defines a signed distance, called ``internal concavity,´´ on paths of the Voronoi diagram of a dot pattern. An algorithm using internal concavity to segment dot patterns is described. The segmentation algorithm produces subsets of the Dirichlet tessellation (Delaunay triangulation) of the dot pattern.
  • Keywords
    Approximation algorithms; Clustering algorithms; Computer graphics; Computer science; Image processing; Image segmentation; Joining processes; Mathematics; Nearest neighbor searches; Pattern recognition; Blum transform; Delaunay; Dirichlet; Voronoi diagram; clustering; dot patterns; internal concavity; segmentation; spread angle;
  • fLanguage
    English
  • Journal_Title
    Pattern Analysis and Machine Intelligence, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0162-8828
  • Type

    jour

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