Efficiently Approximating Polygonal Paths in Three and Higher Dimensions

ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE

David H. Douglas, Thomas K. Peucker · Cartographica The International Journal for Geographic Information and Geovisualization · 1973 · 4.1K citations

Record Lines, Engineering, Geometry +22

Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Nimrod Megiddo · Journal of the ACM · 1983 · 632 citations · Full text

An efficiently computable metric for comparing polygonal shapes

Esther M. Arkin, L. Paul Chew, D.P. Huttenlocher et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1991 · 624 citations

Engineering, Geometry, Shape Analysis +16

Computational-geometric methods for polygonal approximations of a curve

Hiroshi Imai, Masao Iri · Computer Vision Graphics and Image Processing · 1986 · 171 citations

Numerical Analysis, Geometric Modeling, Geometric Interpolation +8

APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR

Wai‐Sum Chan, F. Chin · International Journal of Computational Geometry & Applications · 1996 · 143 citations

Numerical Analysis, Engineering, Geometry +16