Efficient spiral search in bounded spaces
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 sequ...
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 4(1982), 2 vom: 01. Feb., Seite 208-15 |
|---|---|
| 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: | 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 |
|---|---|
| Beschreibung: | Date Completed 02.10.2012 Date Revised 12.11.2019 published: Print Citation Status PubMed-not-MEDLINE |
| ISSN: | 1939-3539 |