210 likes | 322 Views
The GPX Cleaner project is focused on the development of a point reduction algorithm for GPX files, utilizing two primary approaches. The first approach filters out points based on direct neighbors, facilitating an initial cleanup of the track data. The second approach assesses the importance of each point and retains vital points, enhancing the quality of the cleaned track. Both methods aim to optimize GPX file accuracy while a final combined algorithm is in testing. Coordination conversion to distances is essential, involving basic mathematics.
E N D
Team GPXCleaner Project Status
GPX Files I/O 2014-12-01 9
Point reduction algorithm • Two approaches • First approach • Kicks out points based on direct neighbours • Good for initial cleanup of the track • Second approach • Kicks out points based on importantness • Good for refinement of a clean track
Second approach • Idea: Mark vital points. Kick out all points that are not vital points. • Start point and end point are vital. • Repeat: • Find point with maximal d when compared to its neighbour vital points. • This point is a new vital point. • Until the limit is reached.
Final words • Final algorithm will be a combination of both approaches • Final algorithm already implemented in C for testing purposes. • We need to convert coordinates to distances (not trivial) • Calculating d can be done using basic mathematics