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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Intelligent Information Technologies
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.