By Topic

Efficient Spiral Search in Bounded Spaces

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
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.

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:PAMI-4 ,  Issue: 2 )