Adaptive Algorithms for Points Searching and Sorting

Written by David Podgorelec (external)

David Podgorelec

University of Maribor, Slovenia

Seminar in English
November 6, 2008 at 13:30
University of West Bohemia, UK417

Abstract

(download in PDF)

Three topics, recently investigated by the author are considered in this presentation. In the first part, an incremental nearest point search algorithm based on evenly populated strips is described. The algorithm is much less affected by differences in point distributions than the previous practical solutions proposed by the Gemma lab researchers. The second topic addresses adaptive geometric data sorting. An original, linear time inplace merging is proposed and integrated into the smart mergesort algorithm. The third topic is about repeated sorting of the distances between the set of static points and the moving reference point.