|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM211013080 |
| 003 |
DE-627 |
| 005 |
20231224012719.0 |
| 007 |
tu |
| 008 |
231224s1982 xx ||||| 00| ||eng c |
| 028 |
5 |
2 |
|a pubmed24n0703.xml
|
| 035 |
|
|
|a (DE-627)NLM211013080
|
| 035 |
|
|
|a (NLM)21869050
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Lee, D T
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Medial axis transformation of a planar shape
|
| 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 The medial axis transformation is a means first proposed by Blum to describe a shape. In this paper we present a 0(n log n) algorithm for computing the medial axis of a planar shape represented by an n-edge simple polygon. The algorithm is an improvement over most previously known results interms of both efficiency and exactness and has been implemented in Fortran. Some computer-plotted output of the program are also shown in the paper
|
| 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), 4 vom: 01. Apr., Seite 363-9
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:4
|g year:1982
|g number:4
|g day:01
|g month:04
|g pages:363-9
|
| 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 4
|b 01
|c 04
|h 363-9
|