Generalization of Spatial Data: Principles and Selected Algorithms
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
Speeding Up the Douglas-Peucker Line-Simplification Algorithm
Speeding Up the Douglas-Peucker Line-Simplification Algorithm
A Fast and Simple Heuristic for Metro Map Path Simplification
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
On d-regular schematization of embedded paths
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Faster algorithms for minimum-link paths with restricted orientations
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
A new method for subdivision simplification with applications to urban-area generalization
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Path schematization for route sketches
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Fast and simple approach for polygon schematization
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
GD'12 Proceedings of the 20th international conference on Graph Drawing
On d-regular schematization of embedded paths
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We study the C-oriented line simplification problem: Given a polygonal chain P represented by an ordered set of vertices p1. . . . pn in the plane, a set of orientations C, and a constant Ɛ, we search for a "C-oriented" polygonal chain Q consisting of the minimum number of line segments that has distance at most Ɛ to P in the FrÉchet metric. A polygonal chain is C-oriented if the line segments are parallel to orientations in C. We restrict our attention to the version of the problem where two circles of radius Ɛ formed around adjacent vertices of the polygonal chain do not intersect. We solve the C-oriented line simplification problem constructively by using dynamic programming together with a nice data structure. For usual cases of C our algorithm solves the problem in time O(kn2 log(n)) where k is the minimum number of line segments of Q and uses O(kn2) space.