The aim of this algorithm is to seek a filter for polyline vertices while seeking the polyline’s smoothing at the same time. The process consists of creating a new polyline from the original polyline by using its segments’ midpoints. When this algorithm is selected, the program requests two parameters:
Minimum Segment Length: Any segment of the polyline whose length is greater than the value entered will be processed by the algorithm.
Maximum Length Accepted: If there is any segment whose length is greater than this distance, the segment will be subdivided into as many minimum segment lengths as possible.
MDT will start by processing all polylines with the second parameter and will then apply the first in order to extract all the intermediate points.
The effect of applying the algorithm to a polyline may be seen below.
TcpMDT
