>> Would it be easy to implement the Douglas-Peucker algorithm to simplify >> a track? >> >> http://en.wikipedia.org/wiki/Ramer–Douglas–Peucker_algorithm >> >> i think this would be a good way to simplify a track not with time, >> angle or distance but amount of trackpoints (it can be run recursively >> and after each run tested if the amount of points is less then the limit >> set). > Douglas Peucker sounds good! > As far as I know, it is really on of the classic track reduction > algorithms.
yea, its one of the classic line simplification algorithms ... another also useful one for tracks is the visvalingam algorithm: http://www2.dcs.hull.ac.uk/CISRG/projects/Royal-Inst/demos/mahes.html same advantage that you can limit the point number and it makes the best out of it. since it will always prefer keeping points at sharp crossings, it might be very useful to minimalize longer tracks/routes for longer trips. i do not know which is in the end more useful, but these two are the best for tracks/routes to my knowledge. maybe some math people know more sophisticated algorithms. > Just do it :-) ! > i would have already done it, just have no clue how to. i'm molecular biologist by training and my programming skills are way less compared to my cloning skills ;) greetings damir ------------------------------------------------------------------------------ EditLive Enterprise is the world's most technically advanced content authoring tool. Experience the power of Track Changes, Inline Image Editing and ensure content is compliant with Accessibility Checking. http://p.sf.net/sfu/ephox-dev2dev _______________________________________________ Qlandkartegt-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/qlandkartegt-users
