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,383 citations
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Douglas, D. H., & Peucker, T. K. (1973). ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE. Cartographica The International Journal for Geographic Information and Geovisualization, 10(2), 112–122. https://doi.org/10.3138/fm57-6770-u75u-7727
In text: (Douglas & Peucker, 1973)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
Abstract
All digitizing methods, as a general rule, record lines with far more data than is necessary for accurate graphic reproduction or for computer analysis. Two algorithms to reduce the number of points required to represent the line and, if desired, produce caricatures, are presented and compared with the most promising methods so far suggested. Line reduction will form a major part of automated generalization.
Related papers
Metadata from OpenAlex (CC0). Citations are generated from the published record.