Meta-heuristic Coefficient for Indexing Geometric Objects in Hierarchical Spatial Data-Structures

Hierarchical spatial data structures are usually employed for indexing geometric objects and are characterized by recursively decomposing the space. Due to this recursion process is necessary to define a decision criteria to determine when to stop the process of spatial decomposition. In this paper, a new recursion threshold for indexing hierarchical spatial data structures that is independent of the nature of the data is introduced. The objective is to reduce the execution time of space searches that arise in various applications of modern computing systems such as mining, solid modelling, simulation and others. Results indicate that the proposed recursion threshold reduces the execution time of space searches respect to others criteria of general purpose reported in the literature, however, RAM consumption is increased considerably.