This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Spiral Search in Bounded Spaces
February 1982 (vol. 4 no. 2)
pp. 208-215
Richard W. Hall, Department of Electrical Engineering, University of Pittsburgh, Pittsburgh, PA 15261.
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.
Citation:
Richard W. Hall, "Efficient Spiral Search in Bounded Spaces," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 4, no. 2, pp. 208-215, Feb. 1982, doi:10.1109/TPAMI.1982.4767228
Usage of this product signifies your acceptance of the Terms of Use.