project status

108-12-03

Project Status

Team GPXCleaner

208-12-03

Where are we so far?

308-12-03

What is there to do?

08-12-03

08-12-03

08-12-03

08-12-03

08-12-03

08-12-03 923-04-19

GPX Files I/O

08-12-03

Point reduction algorithm

Two approachesFirst approach

Kicks out points based on direct neighbours

Good for initial cleanup of the track

Second approachKicks out points based on importantness

Good for refinement of a clean track

08-12-03

First approach

08-12-03

First approach

08-12-03

First approach

08-12-03

First approach

08-12-03

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.

08-12-03

Second approach

08-12-03

Second approach

08-12-03

Second approach

08-12-03

Second approach

08-12-03

Second approach

08-12-03

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