A method using airport surveillance data to output a location of a delay and an amount of time a vehicle is subjected to the delay during a movement of the vehicle between a first location and a second location, the method comprising:
- obtaining a time-ordered sequence of data points representing the movement of the vehicle, each data point including an (x) position coordinate and a (y) position coordinate, at a particular time represented by a time stamp;
- creating a vector (sv) including a plurality of elements, each of the elements corresponding to a respective one of the data points from the time ordered sequence, each of the elements being a ground speed associated with the respective data point;
- replacing all of the ground speed entries in the vector (sv) with one of a zero (0) entry and a one (1) entry;
- the one (1) entry if the ground speed entry is less than the predetermined minimum ground speed (GSmin) or if the ground speed is not a number, the zero (0) entry if the ground speed is equal to or greater than the predetermined minimum ground speed (GSmin) and the ground speed value is not a number;
- defining a starting index and a stopping index within the vector (sv) for each sequence of consecutive one (1) entries, each of the sequences of consecutive one (1) entries defining a proposed knot;
- defining a time duration of each of the proposed knots using the time stamps of the respective data points;
- eliminating any proposed knot having a duration of less than a predetermined time duration (T);
- performing the following steps for each remaining proposed knot (ki):
- finding a mean location (E(x), E(y)) for the proposed knot (pi), the mean location being the average of the (x) and (y) coordinates of data points in the sequence of consecutive (1) entries in the proposed knot (pi);
- calculating a radial distance (pr) between the mean location (E(x), E(y)) of the proposed knot (pi) and the (x) and (y) coordinates of each respective data point corresponding to the sequence of consecutive (1) entries in the proposed knot (pi), each radial distance (pr) being equal to [(xi−E(x))2+(yi−E(y))2]1/2;
- computing a scale factor (m) where m=loge(length (pr))/OSR, wherein OSR is a predetermined variable;
- and
- keeping data points associated with the proposed knot if pr is less than the larger of the two values from the inequality pr<max (maxDistance, m·std(pr));
- merging any of the proposed knots that overlap;
- identifying the data points associated with any remaining proposed knot as being associated with the respective proposed knot;
- and
- saving the data points identified onto a computer readable medium for at least one of review by an individual, production of a graphical display on a computer terminal, and production of a presentation document identifying those data points as being associated with one of the proposed knots.