Efficient Algorithmic Techniques for Several Multidimensional Geometric Data Management and Analysis Problems
Computational Geometry
2013-01-03 v2 Discrete Mathematics
Data Structures and Algorithms
Abstract
In this paper I present several novel, efficient, algorithmic techniques for solving some multidimensional geometric data management and analysis problems. The techniques are based on several data structures from computational geometry (e.g. segment tree and range tree) and on the well-known sweep-line method.
Cite
@article{arxiv.0810.4423,
title = {Efficient Algorithmic Techniques for Several Multidimensional Geometric Data Management and Analysis Problems},
author = {Mugurel Ionut Andreica},
journal= {arXiv preprint arXiv:0810.4423},
year = {2013}
}
Comments
The algorithmic techniques presented in this paper were later used by the author in developing solutions for algorithmic tasks in several contests in which the author participated (see the attached zip archive for some examples of task statements and solutions). Knowledge Management - Projects, Systems and Technologies, Bucharest : Romania (2008)