A topology construction from line drawings using a uniform plane subdivision technique
The paper describes an algorithm for constructing the topology from a set of line segments or polylines. The problem appears for example at land-maps that have been drawn by general-purpose drawing packages or captured from blue-prints by digitalisation. The solution comprises two steps; in the first step inconsistencies in the input data are detected and removed, and in the second step the topology is constructed. The algorithm for topology construction consists of two phases: determination of a concave hull, and generation of polygons. It is shown that the running-time of the presented algorithm is better than O(n2), where n is the number of input points. Because of a large number of geometric elements being expected, the geometric search needed at the first step of the algorithm is speeded up by an acceleration techniquea uniform plane subdivision.
topology construction computational geometry uniform space subdivision