Optimum Uniform Piecewise Linear Approximation of Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computational-geometric methods for polygonal approximations of a curve
Computer Vision, Graphics, and Image Processing
On the Detection of Dominant Points on Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Polygonal approximation by boundary reduction
Pattern Recognition Letters
A non-parametric sequential method for polygonal approximation of digital curves
Pattern Recognition Letters
Optimum polygonal approximation of digitized curves
Pattern Recognition Letters
An algorithm for polygonal approximation based on iterative point elimination
Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition Letters
A new method for polygonal approximation using genetic algorithms
Pattern Recognition Letters
Cartographic line simplification and polygon CSG formulæ in O(n log* n) time
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Convexity rule for shape decomposition based on discrete contour evolution
Computer Vision and Image Understanding
An efficient algorithm for the optimal polygonal approximation of digitized curves
Pattern Recognition Letters
An adaptive split-and-merge method for binary image contour data compression
Pattern Recognition Letters
On Critical Point Detection of Digital Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition Letters
Bidimensional Shapes Polygonalization by ACO
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Reduced-search dynamic programming for approximation of polygonal curves
Pattern Recognition Letters
IEEE Transactions on Computers
Polygonal approximation of closed contours
SCIA'03 Proceedings of the 13th Scandinavian conference on Image analysis
An optimal polygonal boundary encoding scheme in the rate distortion sense
IEEE Transactions on Image Processing
Polygonal approximation of closed discrete curves
Pattern Recognition
Distortion-constrained compression of vector maps
Proceedings of the 2007 ACM symposium on Applied computing
Extraction and removal of layers from map imagery data
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Optimal encoding of vector data with polygonal approximation and vertex quantization
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Segmentation and multi-model approximation of digital curves
Pattern Recognition Letters
ISE-bounded polygonal approximation of digital curves
Pattern Recognition Letters
A non-heuristic dominant point detection based on suppression of break points
ICIAR'12 Proceedings of the 9th international conference on Image Analysis and Recognition - Volume Part I
Optimal algorithm for lossy vector data compression
ICIAR'07 Proceedings of the 4th international conference on Image Analysis and Recognition
A novel framework for making dominant point detection methods non-parametric
Image and Vision Computing
| Hi-index | 0.01 |
Fast algorithm for joint near-optimal approximation of multiple polygonal curves is proposed. It is based on iterative reduced search dynamic programming introduced earlier for the min-@eproblem of a single polygonal curve. The proposed algorithm jointly optimizes the number of line segments allocated to the different individual curves, and the approximation of the curves by the given number of segments. Trade-off between time and optimality is controlled by the breadth of the search, and by the numbers of iterations applied.