|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM216985900 |
| 003 |
DE-627 |
| 005 |
20231224033023.0 |
| 007 |
tu |
| 008 |
231224s1982 xx ||||| 00| ||eng c |
| 028 |
5 |
2 |
|a pubmed24n0723.xml
|
| 035 |
|
|
|a (DE-627)NLM216985900
|
| 035 |
|
|
|a (NLM)22499636
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Kim, C E
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Digital convexity, straightness, and convex polygons
|
| 264 |
|
1 |
|c 1982
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
| 338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 02.10.2012
|
| 500 |
|
|
|a Date Revised 12.11.2019
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a 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
|
| 650 |
|
4 |
|a Journal Article
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 4(1982), 6 vom: 01. Juni, Seite 618-26
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:4
|g year:1982
|g number:6
|g day:01
|g month:06
|g pages:618-26
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 4
|j 1982
|e 6
|b 01
|c 06
|h 618-26
|