Line Simplification with Restricted Orientations
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Spatio-temporal data reduction with deterministic error bounds
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Tabu split and merge for the simplification of polygonal curves
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Maintaining the personal style and flair of handwriting in presentation recordings
Rainbow of computer science
ShortStraw: a simple and effective corner finder for polylines
SBM'08 Proceedings of the Fifth Eurographics conference on Sketch-Based Interfaces and Modeling
| Hi-index | 0.00 |
We analyze the line simplification algorithm reported by Douglas and Peucker and show that its worst case is quadratic in n, the number of input points. Then we give a algorithm, based on path hulls, that uses the geometric structure of the problem to attain a worst-case running time proportional to n log_2(n), which is the best case of the Douglas algorithm. We give complete C code and compare the two algorithms theoretically, by operation counts, and practically, by machine timings.