Computational-geometric methods for polygonal approximations of a curve
Computer Vision, Graphics, and Image Processing
On approximating polygonal curves in two and three dimensions
CVGIP: Graphical Models and Image Processing
Approximation of Polygonal Curves with Minimum Number of Line Segments
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
Near-Linear Time Approximation Algorithms for Curve Simplification
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Polygonal path simplification with angle constraints
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We consider the problem of simplifying an n-vertex polygonal chain with small angle constraints in R3, arising in flight planning. Specifically, we give an algorithm that solves the min-# version of the polygonal chain simplification problem with small angle constraints in O(n2 log n) time, O(n2) space in R3, thus matching the time and space complexities of the solutions for large angle constraints and for the unconstrained problem. The algorithm uses known data structures and admits efficient implementation.