File organization for aerial photography
Thomas A. Slivinski, Vincent Y. Lum · 1968
This paper presents an analysis of an information storage and retrieval problem encountered in the organization of a file containing a large number of aerial photographs. In analyzing the system, the problem is first abstracted and formulated into a mathematical model so that analytical techniques can be applied. Briefly stated, the problem can be formulated as follows: a large rectangular area A containing k paths (or aerial missions) is given. Each path is composed of an arbitrary number of straight-line segments or rectangles depending on the width of a photo-strip. At a particular time, a polygonal region Q@@A is specified. Information about all parts of line segments or rectangles which lie totally within Q (as well as path information) is to be retrieved. The problem to which this paper is directed deals with the effects on retrieval of constructing a grid system for A. Assuming Q to be much smaller than A, into what sizes should A be divided so that this storage and retrieval process is most efficient. It will be assumed that the grid squares Bi of A are also rectangular.