An Algorithm for Detecting and Eliminating Intersection of Polylines in Cartographic Generalization
Ying Shen · Developments In Surveying and Mapping · 2001
Sometimes polylines intersect or self-intersect because of incorrect selection of algorithm or tolerance when they are simplified in cartographic generalization. Many algorithms avoid this problem, but it actually exists. In this paper,we develop an algorithm to detect it based on the partition of monotone chains, and analysis the situations in contour lines generalization, then present an efficient solution.