Digital squares

Søren Forchhammer; Chul E Kim

doi:10.1109/ICPR.1988.28324

Digital squares

Søren Forchhammer, Chul E Kim

Washington State University Misc. Campuses

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

620 Downloads (Orbit)

Abstract

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 language	English
Title of host publication	9th International Conference on Pattern Recognition,
Volume	Volumen 2
Publisher	IEEE
Publication date	1988
Pages	672-674
ISBN (Print)	0-8186-0878-1
DOIs	https://doi.org/10.1109/ICPR.1988.28324
Publication status	Published - 1988
Event	9th International Conference on Pattern Recognition - Rome, Italy Duration: 14 May 1988 → 17 May 1988 Conference number: 9 http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=220

Conference

Conference	9th International Conference on Pattern Recognition
Number	9
Country/Territory	Italy
City	Rome
Period	14/05/1988 → 17/05/1988
Internet address	http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=220

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

Access to Document

10.1109/ICPR.1988.28324

SorenFinal published version, 281 KB

OpenUrl availability

Full text

Cite this

@inproceedings{067d48b82e8b4ce4949097a467c78e09,

title = "Digital squares",

abstract = "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",

author = "S{\o}ren Forchhammer and Kim, {Chul E}",

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; 9th International Conference on Pattern Recognition ; Conference date: 14-05-1988 Through 17-05-1988",

year = "1988",

doi = "10.1109/ICPR.1988.28324",

language = "English",

isbn = "0-8186-0878-1",

volume = "Volumen 2",

pages = "672--674",

booktitle = "9th International Conference on Pattern Recognition,",

publisher = "IEEE",

address = "United States",

url = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=220",

}

TY - GEN

T1 - Digital squares

AU - Forchhammer, Søren

AU - Kim, Chul E

N1 - Conference code: 9

PY - 1988

Y1 - 1988

N2 - 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

AB - 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

U2 - 10.1109/ICPR.1988.28324

DO - 10.1109/ICPR.1988.28324

M3 - Article in proceedings

SN - 0-8186-0878-1

VL - Volumen 2

SP - 672

EP - 674

BT - 9th International Conference on Pattern Recognition,

PB - IEEE

T2 - 9th International Conference on Pattern Recognition

Y2 - 14 May 1988 through 17 May 1988

ER -

Digital squares

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this