The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Techniques for assessing polygonal approximations of curves
Abstract
Given the enormous number of available methods for finding polygonal approximations to curves techniques are required to assess different algorithms. Some of the standard approaches are shown to be unsuitable if the approximations contain varying numbers of lines. Instead, we suggest assessing an algorithm's results relative to an optimal polygon, and describe a measure which combines the relative fidelity and efficiency of a curve segmentation. We use this measure to compare the application of 23 algorithms to a curve first used by Teh and Chin (1989); their integral square errors (ISEs) are assessed relative to the optimal ISE. In addition, using an example of pose estimation, it is shown how goal-directed evaluation can be used to select an appropriate assessment criterion.
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
DOUGLAS, D. H., & PEUCKER, T. K. (1973) · Cartographica · doi:10.3138/fm57-6770-u75u-7727 · Cited by 4,229
An iterative procedure for the polygonal approximation of plane curves
Ramer, U. (1972) · Computer Graphics and Image Processing · doi:10.1016/s0146-664x(72)80017-0 · Cited by 1,372
Three-dimensional object recognition from single two-dimensional images
Lowe, D. G. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90070-1 · Cited by 1,283
On the detection of dominant points on digital curves
Teh, C.-H., & Chin, R. T. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.31447 · Cited by 726
Goal-directed evaluation of binarization methods
Trier, Ø. D., & Jain, A. K. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.476511 · Cited by 624
Angle Detection on Digital Curves
Rosenfeld, A., & Johnston, E. (1973) · IEEE Transactions on Computers · doi:10.1109/tc.1973.5009188 · Cited by 489
A Corner-Finding Algorithm for Chain-Coded Curves
Freeman, & Davis (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.1674825 · Cited by 484
Scale-based detection of corners of planar curves
Rattarangsi, A., & Chin, R. T. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.126805 · Cited by 308
Optimum Uniform Piecewise Linear Approximation of Planar Curves
Dunham, J. G. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767753 · Cited by 278
Optimum polygonal approximation of digitized curves
Perez, J.-C., & Vidal, E. (1994) · Pattern Recognition Letters · doi:10.1016/0167-8655(94)90002-7 · Cited by 218
Cited by
Feature Extraction and Image Processing
(2002) · Elsevier eBooks · doi:10.1016/c2009-0-25049-5 · Cited by 864
State of the Art in Shape Matching
Veltkamp, R. C., & Hagedoorn, M. (2001) · Advances in Pattern Recognition · doi:10.1007/978-1-4471-3702-3_4 · Cited by 535
Shape matching: similarity measures and algorithms
Veltkamp, R. C. (2002) · Proceedings International Conference on Shape Modeling and Applications · doi:10.1109/sma.2001.923389 · Cited by 434
The effect of news and public mood on stock movements
Li, Q., Wang, T., Li, P., Liu, L., Gong, Q., & Chen, Y. (2014) · Information Sciences · doi:10.1016/j.ins.2014.03.096 · Cited by 255
Steger, C. (2017) · Handbook of Machine and Computer Vision · doi:10.1002/9783527413409.ch9 · Cited by 6
Metadata
- Authors
- Rosin, P. L.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1997-06
- Volume
- 19
- Issue
- 6
- Pages
- 659-666
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2123630097
- Cited by
- 262
- References
- 14
- FWCI
- 6.31
- 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: Techniques for assessing polygonal approximations of curves. https://app.cochat.ai/papers/10.1109/34.601253
- The paper
- Rosin, P. L. (1997). Techniques for assessing polygonal approximations of curves. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/34.601253
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.