Efficient Data Structures for Spatiotemporal Data

Please enable javascript in your browser.

Azizian Foumani, Arash | 2020

808 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 53523 (02)
University: Sharif University of Technology
Department: Mathematical Sciences
Advisor(s): Zarei, Alireza
Abstract:
With rapid increase of availability of moving object data, especially with help of GPS, need for algorithms which can process spatiotemporal data and data structures capable of storing it efficiently, has been increased. One of spatiotemporal data applications is in wild life, which demands tracking of animal movements through time. One of problems introduced in this application is flock problem. Flock is a group of entities, which move together through time. There is a belief that in bulky data, there are a lot of hidden information and patterns. Hence, we believe that with help of flocks, we can get insight of animal behaviors in environment and to each other. In this thesis we will introduce and explore efficient methods to find flocks using spatiotemporal data and how to store these flocks efficiently
Keywords:
Computational Geometry ; Spatiotemporal Dataset ; Time Complexity ; Geometric Data Structures ; Persistent Data Structure