Efficient Algorithmic Techniques for Several Multidimensional Geometric Data Management and Analysis Problems
classification
💻 cs.CG
cs.DMcs.DS
keywords
dataseveraltechniquesalgorithmicanalysisefficientgeometricmanagement
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.