We investigate the concept of a median among a set of trajectories. We establish criteria that a "median trajectory" should meet, and present two different methods to construct a median for a set of input trajectories. The first method is very simple, while the second method is more complicated and uses homotopy with respect to sufficiently large faces in the arrangement formed by the trajectories. We give algorithms for both methods, analyze the worst-case running time, and show that under certain assumptions both methods can be implemented efficiently. We empirically compare the output of both methods on randomly generated trajectories, and analyze whether the two methods yield medians that are according to our intuition. Our results suggest that the second method, using homotopy, performs considerably better.
|Titel||Algorithms - ESA 2010 (18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings. Part I)|
|Redacteuren||M. Berg, de, U. Meyer|
|Plaats van productie||Berlin|
|ISBN van geprinte versie||978-3-642-15774-5|
|Status||Gepubliceerd - 2010|
|Naam||Lecture Notes in Computer Science|
|ISSN van geprinte versie||0302-9743|