Digital convexity, straightness, and convex polygons
New schemes for digitizing regions and arcs are introduced. It is then shown that under these schemes, Sklansky's definition of digital convexity is equivalent to other definitions. Digital convex polygons of n vertices are defined and characterized in terms of geometric properties of digital l...
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 4(1982), 6 vom: 01. Juni, Seite 618-26 |
|---|---|
| 1. Verfasser: | |
| Format: | Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
1982
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence |
| Schlagworte: | Journal Article |
| Zusammenfassung: | New schemes for digitizing regions and arcs are introduced. It is then shown that under these schemes, Sklansky's definition of digital convexity is equivalent to other definitions. Digital convex polygons of n vertices are defined and characterized in terms of geometric properties of digital line segments. Also, a linear time algorithm is presented that, given a digital convex region, determines the smallest integer n such that the region is a digital convex n-gon |
|---|---|
| Beschreibung: | Date Completed 02.10.2012 Date Revised 12.11.2019 published: Print Citation Status PubMed-not-MEDLINE |
| ISSN: | 1939-3539 |