intermediate vertex

intermediate vertex

[‚in·tər¦mēd·ē·ət ′vər‚teks]
(mathematics)
A vertex in an s-t network that is neither the source nor the terminal.
References in periodicals archive ?
We note that the most expensive pseudo-coded step in our recursive procedure is finding the farthest intermediate vertex from the current approximating segment: Find k [element of] (i, j) with [Delta]([[Upsilon].
1) One could easily frame the Douglas-Peucker algorithm as a "subtractive" algorithm: Start with the set of all polyline vertices, then throw away all vertices between i and j when the farthest intermediate vertex from segment [e.

Full browser ?