Efficient Algorithmic Techniques for Several Multidimensional Geometric Data Management and Analysis Problems
arXiv:0810.4423
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.
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)