An Efficient and Topologically Correct Map Generalization Heuristic
نویسندگان
چکیده
We present TopoVW, an efficient heuristic for map simplification that deals with a variation of the generalization problem where the idea is to simplify the polylines of a map without changing the topological relationships between these polylines or between the lines and control points. This process is important for maintaining clarity of cartographic data, avoiding situations such as high density of map features, inappropriate intersections. In practice, high density of features may be represented by cities condensed into a small space on the map, inappropriate intersections may produce intersections between roads, rivers, and buildings. TopoVW is a strategy based on the Visvalingam-Whyatt algorithm to create simplified geometries with shapes similar to the original map, preserving topological consistency between features in the output. It uses a point ranking strategy, in which line points are ranked by their effective area, a metric that determines the impact a point will cause to the geometry if removed from the line. Points with inferior effective area are eliminated from the original line. The method was able to process a map with 4 million line points and 10 million control points in less than 2 minutes on a Intel R © CoreTM 2 Duo processor.
منابع مشابه
TOPOLOGICALLY STATIONARY LOCALLY COMPACT SEMIGROUP AND AMENABILITY
In this paper, we investigate the concept of topological stationary for locally compact semigroups. In [4], T. Mitchell proved that a semigroup S is right stationary if and only if m(S) has a left Invariant mean. In this case, the set of values ?(f) where ? runs over all left invariant means on m(S) coincides with the set of constants in the weak* closed convex hull of right translates of f. Th...
متن کاملGeneralization of Dodgson's "Virtual Center" Method; an Efficient Method for Determinant Calculation
Charles Dodgson (1866) introduced a method to calculate matrices determinant, in asimple way. The method was highly attractive, however, if the sub-matrix or the mainmatrix determination is divided by zero, it would not provide the correct answer. Thispaper explains the Dodgson method's structure and provides a solution for the problemof "dividing by zero" called "virtua...
متن کاملSolving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملA System Approach to Automated Map Generalization
This paper presents a system approach to tackle problems involved in automated map generalization. The system combines database generalization and dynamic object generalization capabilities and is coupled with a map agent on top of a map object. The map agent is for the construction of navigating maps, performing tasks on behalf of, and communicating with, users. The object classes are topologi...
متن کاملOutlier Detection for Support Vector Machine using Minimum Covariance Determinant Estimator
The purpose of this paper is to identify the effective points on the performance of one of the important algorithm of data mining namely support vector machine. The final classification decision has been made based on the small portion of data called support vectors. So, existence of the atypical observations in the aforementioned points, will result in deviation from the correct decision. Thus...
متن کامل