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