Name
Abstract | ||
|---|---|---|
This paper describes a map generalization program we submitted to the ACM SIGSPATIAL Cup 2014. In this competition, the goal is to remove as many points in a set of polygonal lines as quickly as possible with respect to two constraints. The topological relationships among the lines must not change, and the relationships between a set of control points and the lines must not change. Inspired by Visvalingam-Whyatt Algorithm, we iteratively examine successive triplets along each line, and remove the middle point if no control point or point of other lines is in the associated triangle. Based on the features of the training datasets, we further introduce many optimization techniques to speed up the computation. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2666310.2666422 | SIGSPATIAL/GIS |
Keywords | DocType | Citations |
algorithms,spatial databases and gis,map generalization,experimentation,spatial query,spatial index,performance | Conference | 0 |
PageRank | References | Authors |
0.34 | 2 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yanzhe Chen | 1 | 153 | 3.82 |
| Yin Wang | 2 | 12 | 9.28 |
| Rong Chen | 3 | 586 | 30.22 |
| Haibo Chen | 4 | 1749 | 123.40 |
| Binyu Zang | 5 | 984 | 62.75 |