An Efficient Kinetic Range Query for One Dimensional Axis Parallel Segments

T. Hema and K. S. Easwarakumar
Additional contact information
T. Hema: Anna University, Department of Computer Science and Engineering, Chennai, India
K. S. Easwarakumar: Anna University, Department of Computer Science and Engineering, Chennai, India

International Journal of Intelligent Information Technologies (IJIIT), 2018, vol. 14, issue 1, 48-62

Abstract: We present a kinetic data structure named Kinetic Interval Graph (KI-Graph) for performing efficient range search on moving one dimensional axis-parallel segments. This finds applications in Artificial Intelligence such as robotic motion. The structure requires O(n) storage. The time taken per update when a critical event occurs is O (1) thereby improving responsiveness when compared to the kinetic segment trees, while the overall updates across all segments at a time instance is at most n/2. Also, range query is performed efficiently in θ (k) time, where k segments are reported.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
https://services.igi-global.com/resolvedoi/resolve ... 018/IJIIT.2018010104 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jiit00:v:14:y:2018:i:1:p:48-62

Access Statistics for this article

International Journal of Intelligent Information Technologies (IJIIT) is currently edited by Vijayan Sugumaran

More articles in International Journal of Intelligent Information Technologies (IJIIT) from IGI Global
Bibliographic data for series maintained by Journal Editor ().