seed point the nearest boundary point is then discovered using a neighborhood search a divide and conquer algorithm such as binary search between the fail points in a subset and the pass points in the subset may then be used to estimate the boundary location block 250 it is noted that certain embodiments of the present invention may use results comprising pass fail and indeterminate results without departing from the spirit and scope of the present invention in certain embodiments real valued parameter results may be used so that the minority grouping is selected to be a subset of the range of the real valued parameter results referring now to fig3 a flowchart is shown illustrating a boundary scan algorithm 300 according to certain embodiments of the present invention an initial boundary point is oriented with respect to the origin of the schmoo plot block 310 a scan along the boundary is then performed block 320 in certain embodiments the scan is clockwise the scan determines the adjacent point on the boundary to the selected boundary point the scan process is repeated until an adjacent boundary point is found that is substantially close to the initial boundary point block 330 in certain embodiments of the present invention the scan process is complete when a most recent.