T. Hema

most citedBITS-Tree-An Efficient Data Structure for Segment Storage and Query Processing

2 citations · 2 across the 1 of their papers we have counts for

collaborators

2 papers

cs.CG2016

An Optimal Algorithm for Range Search on Multidimensional Points

T. Hema, K. S. Easwarakumar

This paper proposes an efficient and novel method to address range search on multidimensional points in $θ (t)$ time, where $t$ is the number of points reported in $ℜ^{k}$ space. Th…

cs.CG2015★ 2 cited

BITS-Tree-An Efficient Data Structure for Segment Storage and Query Processing

K. S. Easwarakumar, T. Hema

In this paper, a new and novel data structure is proposed to dynamically insert and delete segments. Unlike the standard segment trees[3], the proposed data structure permits inser…