Optimum Uniform Piecewise Linear Approximation of Planar Curves

Authors:
J G Dunham
Affiliations:
-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1986

Citing 0
Cited 44

On the Detection of Dominant Points on Digital Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Adaptive Reduction Procedure for the Piecewise Linear Approximation of Digitized Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Trinocular Stereo Vision for Robotics

IEEE Transactions on Pattern Analysis and Machine Intelligence
Decimation of triangle meshes

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Polygonal approximations that minimize the number of inflections

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Faster Plots by Fan Data Compression

IEEE Computer Graphics and Applications
Using Simple Decomposition for Smoothing and Feature Point Detection of Noisy Digital Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Shape Classes

IEEE Transactions on Pattern Analysis and Machine Intelligence
Nonparametric Segmentation of Curves into Various Representations

IEEE Transactions on Pattern Analysis and Machine Intelligence
Video segmentation based on 2D image analysis

Pattern Recognition Letters - Special issue: Sibgrapi 2001
Stable and Robust Vectorization: How to Make the Right Choices

GREC '99 Selected Papers from the Third International Workshop on Graphics Recognition, Recent Advances
``Seeing'' Objects in Spatial Datasets

IDA '99 Proceedings of the Third International Symposium on Advances in Intelligent Data Analysis
The Envelope of a Digital Curve Based on Dominant Points

DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Approximation of digital curves with line segments and circular arcs using genetic algorithms

Pattern Recognition Letters
Dimensionality reduction of multidimensional temporal data through regression

Pattern Recognition Letters
Information-Theoretic Active Polygons for Unsupervised Texture Segmentation

International Journal of Computer Vision
Using expressive rendering for remote visualization of large city models

Proceedings of the eleventh international conference on 3D web technology
Polygonal approximation of closed discrete curves

Pattern Recognition
A novel approach to polygonal approximation of digital curves

Journal of Visual Communication and Image Representation
Distortion-constrained compression of vector maps

Proceedings of the 2007 ACM symposium on Applied computing
Optimized polygonal approximation by dominant point deletion

Pattern Recognition
Automatic segmentation of metaphase cells based on global context and variant analysis

Pattern Recognition
Compact representation of contours using directional grid chain code

Image Communication
Dominant point detection by reverse polygonization of digital curves

Image and Vision Computing
Novel efficient two-pass algorithm for closed polygonal approximation based on LISE and curvature constraint criteria

Journal of Visual Communication and Image Representation
Fast and quality-guaranteed data streaming in resource-constrained sensor networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Local invariant feature detectors: a survey

Foundations and Trends® in Computer Graphics and Vision
A Unified Curvature Definition for Regular, Polygonal, and Digital Planar Curves

International Journal of Computer Vision
A Mutation-Particle Swarm Algorithm for Error-Bounded Polygonal Approximation of Digital Curves

ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
A PSO-Based Method for Min-ε Approximation of Closed Contour Curves

ISNN '08 Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks
A genetic algorithm with chromosome-repairing for min-# and min-ε polygonal approximation of digital curves

Journal of Visual Communication and Image Representation
Data reduction of large vector graphics

Pattern Recognition
Polygonal approximation of closed contours

SCIA'03 Proceedings of the 13th Scandinavian conference on Image analysis
Piecewise approximation of contours through scale-space selection of dominant points

IEEE Transactions on Image Processing
Linear regression for dimensionality reduction and classification of multi dimensional data

PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Recognition of gesture sequences in real-time flow, context of virtual theater

GW'09 Proceedings of the 8th international conference on Gesture in Embodied Communication and Human-Computer Interaction
Optimal encoding of vector data with polygonal approximation and vertex quantization

SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
A system to support the integrated management of diagnostic medical images

ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing
Fast polynomial segmentation of digitized curves

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Segmentation and multi-model approximation of digital curves

Pattern Recognition Letters
ISE-bounded polygonal approximation of digital curves

Pattern Recognition Letters
Piecewise linear approximation of n-dimensional parametric curves using particle swarms

ANTS'12 Proceedings of the 8th international conference on Swarm Intelligence
CIRCE: Correcting Imprecise Readings and Compressing Excrescent points for querying common patterns in uncertain sensor streams

Information Systems
Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling

Pattern Recognition

Quantified Score

Hi-index	0.14

Visualization

Abstract

Two-dimensional digital curves are often uniformly approximated by polygons or piecewise linear curves. Several algorithms have been proposed in the literature to find such curves. We present an algorithm that finds a piecewise linear curve with the minimal number of segments required to approximate a curve within a uniform error with fixed initial and final points. We compare our optimal algorithm to several suboptimal algorithms with respect to the number of linear segments required in the approximation and the execution time of the algorithm.