Digital squares

Søren Forchhammer, Chul E Kim

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    590 Downloads (Pure)


    Digital squares are defined and their geometric properties characterized. A linear time algorithm is presented that considers a convex digital region and determines whether or not it is a digital square. The algorithm also determines the range of the values of the parameter set of its preimages. The analysis involves transforming the boundary of a digital region into parameter space of slope and y-intercept
    Original languageEnglish
    Title of host publication9th International Conference on Pattern Recognition,
    VolumeVolumen 2
    Publication date1988
    ISBN (Print)0-8186-0878-1
    Publication statusPublished - 1988
    Event9th International Conference on Pattern Recognition - Rome, Italy
    Duration: 14 May 198817 May 1988
    Conference number: 9


    Conference9th International Conference on Pattern Recognition
    Internet address

    Bibliographical note

    Copyright: 1988 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE


    Dive into the research topics of 'Digital squares'. Together they form a unique fingerprint.

    Cite this