11. The optical scanning system of claim 10 wherein such logic means includes a text line counter and a hits counter and additionally includes logic following step (j) thereof when the last swath is done to accomplish the additional steps of: (a) finding the rightmost swath with the maximum number of pairs; (b) setting that swath as the base vector; (c) starting at the bottom of the base vector swath; (d) clearing the text line counter; (e) clearing the hits counter; (f) picking up the next intersection in the swath; (g) saving it in a line array; (h) designating it as "VB"; (i) setting a left search condition; (j) going to step (aa); (k) setting a right search condition; (l) going to step (aa); (m) checking to see if there were too few hits and if there were, proceeding the step (p); (n) processing and saving the data presently in the line array; (o) bumping the text line count by one; (p) checking to see if the processing of the base vector is finished and going to step (r) if it is; (q) clearing the line array and going back to step (e); (r) checking to see if there were too few text lines determined to be in the document and terminating the logic in an error state if there were; (s) determining the skew angle of the text by a linear regression analysis of the data and terminating this portion of the logic; (aa) accessing the text swath to the left or right as requested; (ab) starting at the bottom of the swath; (ac) picking up the next intersection in the swath; (ad) checking to see if no intersection was found and if none was found, going to step (ao); (ae) checking to see if the intersection found was within ten vertical lines of VB and if it was, going to step (ag); (af) checking to see if processing of this swath is finished and going to step (al) if it is and back to step (ac) if it is not; (ag) resetting the bad swath's count; (ah) saving the intersection in the line array; (ai) bumping the hits count; (aj) checking to see if there are presently over 100 hits and going to step (ao) if there are; (ak) designating this intersection as the new VB and going to step (am); (al) bumping the bad swaths count by one; (am) checking to see if swath #1 or swath #79 has been finished and going to step (ao) if it has; (an) checking to see if the bad swaths count is equal to 4 and going to step (aa) if it is not; and, (ao) returning to step (k) if a left search was just accomplished and to step (m) if a right search was just accomplished.
11. The optical scanning system of claim 10 wherein such logic means includes a text line counter and a hits counter and additionally includes logic following step (j) thereof when the last swath is done to accomplish the additional steps of: (a) finding the rightmost swath with the maximum number of pairs; (b) setting that swath as the base vector; (c) starting at the bottom of the base vector swath; (d) clearing the text line counter; (e) clearing the hits counter; (f) picking up the next intersection in the swath; (g) saving it in a line array; (h) designating it as "VB"; (i) setting a left search condition; (j) going to step (aa); (k) setting a right search condition; (l) going to step (aa); (m) checking to see if there were too few hits and if there were, proceeding the step (p); (n) processing and saving the data presently in the line array; (o) bumping the text line count by one; (p) checking to see if the processing of the base vector is finished and going to step (r) if it is; (q) clearing the line array and going back to step (e); (r) checking to see if there were too few text lines determined to be in the document and terminating the logic in an error state if there were; (s) determining the skew angle of the text by a linear regression analysis of the data and terminating this portion of the logic; (aa) accessing the text swath to the left or right as requested; (ab) starting at the bottom of the swath; (ac) picking up the next intersection in the swath; (ad) checking to see if no intersection was found and if none was found, going to step (ao); (ae) checking to see if the intersection found was within ten vertical lines of VB and if it was, going to step (ag); (af) checking to see if processing of this swath is finished and going to step (al) if it is and back to step (ac) if it is not; (ag) resetting the bad swath's count; (ah) saving the intersection in the line array; (ai) bumping the hits count; (aj) checking to see if there are presently over 100 hits and going to step (ao) if there are; (ak) designating this intersection as the new VB and going to step (am); (al) bumping the bad swaths count by one; (am) checking to see if swath #1 or swath #79 has been finished and going to step (ao) if it has; (an) checking to see if the bad swaths count is equal to 4 and going to step (aa) if it is not; and, (ao) returning to step (k) if a left search was just accomplished and to step (m) if a right search was just accomplished. 12. The optical scanning system of claim 11 wherein said logic means includes a histogram buffer and additionally includes logic following step(s) thereof to accomplish the additional steps of: (a) starting at the first swath; (b) de-skewing the intersection data for this swath by using the skew angle calculated in the logic previously; (c) checking to see if the last swath has been processed and if it has, going to step (e); (d) going to the next swath and returning to step (b); (e) starting at the first swath; (f) starting at the bottom of the swath; (g) picking up the next intersection address; (h) adding one to this address's counter in the histogram buffer; (i) checking to see if that was the last address in the swath and returning to step (g) if it was not; (j) checking to see if the last swath has been processed and going to step (l) if it has; (k) going to the next swath and returning to step (f); (l) finding the datums in the histogram; and, (m) establishing the top, bottom, left, and right boundaries for the apparent text lines with respect to the datums.