|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM211012858 |
| 003 |
DE-627 |
| 005 |
20231224012718.0 |
| 007 |
tu |
| 008 |
231224s1982 xx ||||| 00| ||eng c |
| 028 |
5 |
2 |
|a pubmed24n0703.xml
|
| 035 |
|
|
|a (DE-627)NLM211012858
|
| 035 |
|
|
|a (NLM)21869027
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Hall, R W
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Efficient spiral search in bounded spaces
|
| 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 This correspondence defines approaches for the efficient generation of a spiral-like search pattern within bounded rectangularly tessellated regions. The defined spiral-like search pattern grows outward from a given source in a two-dimensional space, thus tending to minimize search time in many sequential tracking tasks. Efficient spiral generation is achieved by minimizing the number of operations required for interaction with boundaries. Algorithms are developed for both rectangular search regions and for arbitrary convex search regions
|
| 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), 2 vom: 01. Feb., Seite 208-15
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:4
|g year:1982
|g number:2
|g day:01
|g month:02
|g pages:208-15
|
| 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 2
|b 01
|c 02
|h 208-15
|