ikd-Tree: An Incremental K-D Tree for Robotic Applications

02/22/2021
by   Yixi Cai, et al.
0

This paper proposes an efficient data structure, ikd-Tree, for dynamic space partition. The ikd-Tree incrementally updates a k-d tree with new coming points only, leading to much lower computation time than existing static k-d trees. Besides point-wise operations, the ikd-Tree supports several features such as box-wise operations and down-sampling that are practically useful in robotic applications. In parallel to the incremental operations (i.e., insert, re-insert, and delete), ikd-Tree actively monitors the tree structure and partially re-balances the tree, which enables efficient nearest point search in later stages. The ikd-Tree is carefully engineered and supports multi-thread parallel computing to maximize the overall efficiency. We validate the ikd-Tree in both theory and practical experiments. On theory level, a complete time complexity analysis is presented to prove the high efficiency. On experiment level, the ikd-Tree is tested on both randomized datasets and real-world LiDAR point data in LiDAR-inertial odometry and mapping application. In all tests, ikd-Tree consumes only 4

READ FULL TEXT

page 1

page 4

page 7

research
07/14/2021

FAST-LIO2: Fast Direct LiDAR-inertial Odometry

This paper presents FAST-LIO2: a fast, robust, and versatile LiDAR-inert...
research
06/13/2021

An efficient way to manage ranges of data with Wise Red-Black Trees

This paper describes the most efficient way to manage operations on rang...
research
11/07/2022

SLICT: Multi-input Multi-scale Surfel-Based Lidar-Inertial Continuous-Time Odometry and Mapping

While feature association to a global map has significant benefits, to k...
research
11/07/2021

Parallel Nearest Neighbors in Low Dimensions with Batch Updates

We present a set of parallel algorithms for computing exact k-nearest ne...
research
10/11/2021

Parallel Batched Interpolation Search Tree

Ordered set (and map) is one of the most used data type. In addition to ...
research
02/01/2023

EMV-LIO: An Efficient Multiple Vision aided LiDAR-Inertial Odometry

To deal with the degeneration caused by the incomplete constraints of si...
research
04/20/2022

JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query Processing

Approximate query processing over dynamic databases, i.e., under inserti...

Please sign up or login with your details

Forgot password? Click here to reset