Outdoor navigati on of vis ually impair ed people m ost often is base d on data from the GPS maps and
Geograph ic Infor mation System s (GI S). Such systems cannot be used fo r naviga tion in the re gions
wher e ther e are not any GPS m aps or the m aps ar e not sufficie ntly preci se and detaile d. This article
descri bes an algorith m for re al-time GPS track simp lification . The test re sults show th at the prop osed
algori thm (RS TS) has effi ciency simila r to th e Doug las–Peuck er algo rithm, which is re garded as the best
for track simp lification . The reducti on of th e number of poi nts in differ ent transp ortation mode s, wh ile
keep ing the s hape of the route, is ove r 90%. The size of the fil e descri bing the track is redu ced m ore than
30 time s. The algori thm finds the critica l point s of the route. This allows for navig ation alon g the track
so conver sion of track to rou te is not nee ded. The algori thm is part of a low cost and wide ly accessi ble
Java 2 Mobile Edi tion (J2ME ) applica tion for naviga tion of visually imp aired