On-line construction of the convex hull of a simple polyline
Information Processing Letters
On approximating polygonal curves in two and three dimensions
CVGIP: Graphical Models and Image Processing
Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Tentative Prune-And-Search For Computing Fixed-Points With Applications To Geometric Computation
Fundamenta Informaticae
A heuristic homotopic path simplification algorithm
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Computing polygonal path simplification under area measures
Graphical Models
| Hi-index | 0.00 |
For a given polygonal chain, we study the min problem, which consists in finding an approximate and ordered subchain with a minimum number of vertices. Previous approaches simplify the input chain relative to an approximation criterion which minimizes the gap between the original chain and the simplified subchain. Nevertheless, no criterion allows us to directly control the visual quality of the final rendered result. Moreover, efficient methods produce peculiar simplifications or entail a useless increase in the number of vertices. A quadraticcomplexity is then required to bypass these misbehaviors and toobtain a good perceptual quality. We define a new criterion which retains the shape of the originalchain and which guarantees that the distance between the renderedsimplification is at most half a pixel away from the originalchain. Thus, our criterion does not produce an incorrect simplification. Based on a flexible tolerance region, it does not involve any side effect that would increase the number of vertices of the simplification. Moreover, our method reaches a near-lineartime complexity and its implementation is based on classical functions. To our knowledge, this is the first algorithm providingall these advantages.