Computational-geometric methods for polygonal approximations of a curve
Computer Vision, Graphics, and Image Processing
Approximation of convex polygons
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Fitting polygonal functions to a set of points in the plane
CVGIP: Graphical Models and Image Processing
On approximating polygonal curves in two and three dimensions
CVGIP: Graphical Models and Image Processing
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Separating objects in the plane by wedges and strips
Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
Simplifying a polygonal subdivision while keeping it simple
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
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
Near-Linear Time Approximation Algorithms for Curve Simplification
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
New Results on Path Approximation
Algorithmica
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
Optimal simplification of polygonal chains for subpixel-accurate rendering
Computational Geometry: Theory and Applications
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
Farthest-Point queries with geometric and combinatorial constraints
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
| Hi-index | 0.00 |
In this paper we present a new, query based approach for approximating polygonal chains in the plane. We give a few results based on this approach, some of more general interest, and propose a greedy heuristic to speed up the computation. Our algorithms are simple, based on standard geometric operations, and thus suitable for efficient implementation. We also show that the query based approach can be used to obtain a subquadratic time exact algorithm with infinite beam criterion and Euclidean distance metric if some condition on the input path holds. Although in a special case, this is the first subquadratic result for path approximation with Euclidean distance metric.