Revision as of 18:32, 24 June 2024 edit PinkDucky91 (talk \| contribs) Extended confirmed users 21,982 edits Filled in 1 bare reference(s) with reFill 2 ← Previous edit		Revision as of 13:57, 4 August 2024 edit undo Kenneth Kho (talk \| contribs) Extended confirmed users 1,512 edits Better reflect the abstract of the source itself, also supported by the significant "Performance Evaluation of Line Simplification Algorithms for Vector Generalization" by Wenzhong Shi and ChuiKwan Cheung (2006) Next edit →
Line 57: == Application == The algorithm is used for the processing of [[vector graphics]] and [[cartographic generalization]]. It ~~does~~is ~~not~~recognized ~~always~~as ~~preserve~~the one that delivers the ~~property~~best perceptual representations of ~~non-~~the original lines. But a self-intersection ~~for~~could ~~curves~~occur ~~which~~if ~~has~~the accepted approximation is not sufficiently fine which led to the development of variant algorithms.<ref>{{cite book \|doi = 10.1109/SIBGRA.2003.1240992 \|chapter = A non-self-intersection Douglas-Peucker algorithm \|year = 2003 \|last1 = Wu \|first1 = Shin-Ting \|title = 16th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2003) \|last2 = Marquez \|first2 = Mercedes \|pages = 60–66 \|place = Sao Carlos, Brazil \|publisher= IEEE\|isbn = 978-0-7695-2032-2 \|citeseerx = 10.1.1.73.5773 \|s2cid = 10163908 }}</ref> The algorithm is widely used in robotics<ref>{{cite journal \|doi = 10.1007/s10514-007-9034-y \|title = A comparison of line extraction algorithms using 2D range data for indoor mobile robotics \|year = 2007 \|last1 = Nguyen \|first1 = Viet \|last2 = Gächter \|first2 = Stefan \|last3 = Martinelli \|first3 = Agostino \|last4 = Tomatis \|first4 = Nicola \|last5 = Siegwart \|first5 = Roland \|journal = Autonomous Robots \|volume = 23 \|issue = 2 \|pages = 97–111 \| url = http://doc.rero.ch/record/320492/files/10514_2007_Article_9034.pdf \|hdl = 20.500.11850/9089 \|s2cid = 35663952 \|hdl-access = free }}</ref> to perform simplification and denoising of range data acquired by a rotating [[laser rangefinder\|range scanner]]; in this field it is known as the split-and-merge algorithm and is attributed to [[Richard O. Duda\|Duda]] and [[Peter E. Hart\|Hart]].<ref>{{cite book \|first1=Richard O. \|last1=Duda \|authorlink1=Richard O. Duda \|first2=Peter E. \|last2=Hart \|authorlink2=Peter E. Hart \|title=Pattern classification and scene analysis \|url=https://archive.org/details/patternclassific0000duda \|url-access=registration \|publisher=Wiley \|___location=New York \|year=1973 \|isbn=0-471-22361-1}}</ref>

Ramer–Douglas–Peucker algorithm: Difference between revisions