Target search by golden weave

  • W. E. Sharp


The optimal sequential procedure for performing a track search of a region is by the method of successive halving. This method minimizes the minimum deviation from the ideality of sequential division of a region into equally sized areas. For most track searches no cost is incurred in going from an exit point on the perimeter of a region to the next entry point. In the special circumstance where this cost becomes significant, a sequential track search by the golden weave becomes attractive.

Key words

Track search golden weave golden division entropy 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Shannon, C. E., and Weaver, W., 1964, The mathematical theory of communication: University of Illinois Press, Urbana.Google Scholar
  2. Sharp, W. E., 1978, Golden weaves: Math. Gaz., v. 62, p. 42–44.Google Scholar
  3. Steinhaus, H., 1969, Mathematical snapshots (3rd ed.): Oxford University Press, New York.Google Scholar
  4. Wilde, D. J., 1964, Optimum seeking methods: Prentice-Hall, Englewood Cliffs, New Jersey.Google Scholar

Copyright information

© Plenum Publishing Corporation 1981

Authors and Affiliations

  • W. E. Sharp
    • 1
  1. 1.Department of GeologyUniversity of South CarolinaColumbiaUSA

Personalised recommendations