An O(nlogn) implementation of the Douglas-Peucker algorithm for line simplification
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computing minimum length paths of a given homotopy class
Computational Geometry: Theory and Applications
Geometry in GIS is not combinatorial: segment intersection for polygon overlay
Proceedings of the eleventh annual symposium on Computational geometry
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Hardware-assisted view-dependent map simplification
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Heuristics for the Generation of Random Polygons
Proceedings of the 8th Canadian Conference on Computational Geometry
Algorithms and complexity results for three problems in applied computational geometry: subdivision simplification, stripification of triangulations, and unions of jordan regions
Polygonal chain approximation: a query based approach
Computational Geometry: Theory and Applications
Area-preserving approximations of polygonal paths
Journal of Discrete Algorithms
Approximate isocontours and spatial summaries for sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Efficient and consistent line simplification for web mapping
International Journal of Web Engineering and Technology
Taximeter verification using imprecise data from GPS
Engineering Applications of Artificial Intelligence
A chorem-based approach for visually synthesizing complex phenomena
Information Visualization
Polygonal path simplification with angle constraints
Computational Geometry: Theory and Applications
Area-preserving subdivision schematization
GIScience'10 Proceedings of the 6th international conference on Geographic information science
A heuristic homotopic path simplification algorithm
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Progressive transmission of vector map data based on polygonal chain simplification
ICAT'06 Proceedings of the 16th international conference on Advances in Artificial Reality and Tele-Existence
Genetic algorithms for estimating longest path from inherently fuzzy data acquired with GPS
IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
Hi-index | 0.00 |
We study the problem of simplifying a polygonal subdivision, subjectof a given error bound, $\epsilon$, and subject to maintaining the topology of the input, while not introducing new (Steiner) vertices. In particular, we require that the simplified chains may not cross themselves or cross other chains. In GIS applications, for example, we are interested in simplifying the banks of a river without the left and right banks getting “tangled” and without “islands” becoming part of the land mass. Maintaining topology during subdivision simplification is an important constraint in many real GIS applications.\noindent We give both theoretical and experimental results.(a). We prove that the general problem we are trying to solve is in fact difficult to solve, even approximately: we show that it is MIN PB-complete and that, in particular, assuming P $\neq$ NP, in the general case we cannot obtain in polynomial time an approximation within a factor $n^{1/5-\delta}$ of an optimal solution.(b). We propose some heuristic methods for solving the problem, which we have implemented. Our experimental results show that, in practice, we get quite good simplifications in a reasonable amount of time.