A method of finding a connected path, in a feld of points of known positions, between designated start and end points, comprising the steps of storing the points of known position in a memory, and:
- (a) tesselating said field into a plurality of blocks;
- (b) sectoring said field about said start point;
- (c) identifying a target sector in which lies a straightline vector from said start point to said end point;
- (d) defining a search area, initially enclosing only the block in which said start point lies;
- (e) checking said search area for the presence of at least one of said points of known positions;
- (f) if none of said points of known position is found in step (e), expanding said search area to include blocks adjoining blocks already in said search area and lying at least in part within said target sector;
- (g) repeating steps (e) and (f) until at least one of said points is found in step (e);
- (h) defining the point found in step (a) as said start point;
- (i) repeating steps (d) through (g) in the order listed to determine said end point;
- and
- (j) electronically generating said connected path based on the start and end points found in steps (h) and (i).