The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
An iterative procedure for the polygonal approximation of plane curves
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On the approximation of curves by line segments using dynamic programming
Bellman, R. (1961) · Communications of the ACM · doi:10.1145/366573.366611 · Cited by 444
Approximation of curves by line segments
Stone, H. (1961) · Mathematics of Computation · doi:10.1090/s0025-5718-1961-0119390-6 · Cited by 104
Cited by
An online algorithm for segmenting time series
Keogh, E., Chu, S., Hart, D., & Pazzani, M. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989531 · Cited by 1,149
Image Matching from Handcrafted to Deep Features: A Survey
Ma, J., Jiang, X., Fan, A., Jiang, J., & Yan, J. (2021) · International Journal of Computer Vision · doi:10.1007/s11263-020-01359-2 · Cited by 990
Epipolar-plane image analysis: An approach to determining structure from motion
Bolles, R. C., Baker, H. H., & Marimont, D. H. (1987) · International Journal of Computer Vision · doi:10.1007/bf00128525 · Cited by 892
Historical review of OCR research and development
Mori, S., Suen, C. Y., & Yamamoto, K. (1992) · Proceedings of the IEEE · doi:10.1109/5.156468 · Cited by 892
SEGMENTING TIME SERIES: A SURVEY AND NOVEL APPROACH
Keogh, E., Chu, S., Hart, D., & Pazzani, M. (2004) · Series in Machine Perception and Artificial Intelligence · doi:10.1142/9789812565402_0001 · Cited by 600
Metadata
- Authors
- Ramer, U.
- Venue
- Computer Graphics and Image Processing
- Publisher
- Elsevier BV
- Published
- 1972-11
- Volume
- 1
- Issue
- 3
- Pages
- 244-256
- ISSN
- 0146-664X (ISSN-L)
- OpenAlex
- W2155195832
- Cited by
- 1,372
- References
- 2
- FWCI
- 6.80
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An iterative procedure for the polygonal approximation of plane curves. https://app.cochat.ai/papers/10.1016/s0146-664x(72)80017-0
- The paper
- Ramer, U. (1972). An iterative procedure for the polygonal approximation of plane curves. Computer Graphics and Image Processing. https://doi.org/10.1016/s0146-664x(72)80017-0
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
