Discrete geometric shapes: Matching, interpolation, and approximation
In this chapter we survey geometric techniques which have been used to measure the
similarity or distance between shapes, as well as to approximate shapes, or interpolate …
similarity or distance between shapes, as well as to approximate shapes, or interpolate …
Polygonal approximations of a curve—formulations and algorithms
I Hiroshi, IRI Masao - Machine Intelligence and Pattern Recognition, 1988 - Elsevier
A general framework for polygonal approximation problems in various situations is given,
and solution algorithms are discussed. The problems are classified according to three …
and solution algorithms are discussed. The problems are classified according to three …
Infrared-visible image fusion method based on sparse and prior joint saliency detection and LatLRR-FPDE
In this paper, a new infrared and visible image fusion method based on saliency detection
and LatLRR-FPDE is proposed to ensure the saliency of the fused target and improve the …
and LatLRR-FPDE is proposed to ensure the saliency of the fused target and improve the …
Approximation of polygonal curves with minimum number of line segments or minimum error
WS Chan, F Chin - International Journal of Computational Geometry …, 1996 - World Scientific
We improve the time complexities for solving the polygonal curve approximation problems
formulated by Imai and Iri. The time complexity for approximating any polygonal curve of n …
formulated by Imai and Iri. The time complexity for approximating any polygonal curve of n …
Near-linear time approximation algorithms for curve simplification
We consider the problem of approximating a polygonal curve P under a given error criterion
by another polygonal curve P'whose vertices are a subset of the vertices of P. The goal is to …
by another polygonal curve P'whose vertices are a subset of the vertices of P. The goal is to …
A Fast Multiresolution Polygonal Approximation Algorithm for GPS Trajectory Simplification
M Chen, M Xu, P Franti - IEEE Transactions on Image …, 2012 - ieeexplore.ieee.org
Recent advances in geopositioning mobile phones have made it possible for users to collect
a large number of GPS trajectories by recording their location information. However, these …
a large number of GPS trajectories by recording their location information. However, these …
Polygonal representation of digital planar curves through dominant point detection—a nonparametric algorithm
M Marji, P Siy - Pattern Recognition, 2004 - Elsevier
We describe a new algorithm that detects a set of feature points on the boundary of an 8-
connected shape that constitute the vertices of a polygonal approximation of the shape itself …
connected shape that constitute the vertices of a polygonal approximation of the shape itself …
Polygonal approximation of digital planar curves through break point suppression
This paper presents a new algorithm that detects a set of dominant points on the boundary of
an eight-connected shape to obtain a polygonal approximation of the shape itself. The set of …
an eight-connected shape to obtain a polygonal approximation of the shape itself. The set of …
Efficient algorithms for approximating polygonal chains
We consider the problem of approximating a polygonal chain C by another polygonal chain
C'whose vertices are constrained to be a subset of the set of vertices of C. The goal is to …
C'whose vertices are constrained to be a subset of the set of vertices of C. The goal is to …
Efficient piecewise-linear function approximation using the uniform metric: (preliminary version)
MT Goodrich - Proceedings of the tenth annual symposium on …, 1994 - dl.acm.org
We give an O (n log n)-time method for finding a best k-link piecewise-linear function
approximating an n-point planar data set using the well-known uniform metric to measure …
approximating an n-point planar data set using the well-known uniform metric to measure …