Fetching the paper…
Reading the bibliography…
This paper proposes an efficient data structure, ikd-Tree, for dynamic space partition.
R. Bayer, “Symmetric binary b-trees: Data structure and maintenance algorithms,” Acta informatica , vol. 1, no. 4, pp. 290–306, 1972
1972
Earlier work this paper cites.
J. L. Bentley, “Multidimensional binary search trees used for associative searching,” Communications of the ACM , vol. 18, no. 9, pp. 509–517, 1975
1975
Earlier work this paper cites.
J. H. Friedman, J. L. Bentley, and R. A. Finkel, An algorithm for finding best matches in logarithmic time . Department of Computer Science, Stanford University, 1975
1975
Earlier work this paper cites.
J. L. Bentley and J. B. Saxe, “Decomposable searching problems i: Static-to-dynamic transformation,” J. algorithms , vol. 1, no. 4, pp. 301–358, 1980
1980
Earlier work this paper cites.
J. T. Robinson, “The kdb-tree: a search structure for large multidimensional dynamic indexes,” in Proceedings of the 1981 ACM SIGMOD international conference on Management of data , 1981, pp. 10–18
1981
Earlier work this paper cites.
D. D. Sleator and R. E. Tarjan, “Self-adjusting binary search trees,” Journal of the ACM (JACM) , vol. 32, no. 3, pp. 652–686, 1985
1985
Earlier work this paper cites.
C. R. Aragon and R. Seidel, “Randomized search trees,” in FOCS , vol. 30, 1989, pp. 540–545
1989
Earlier work this paper cites.
I. Galperin and R. L. Rivest, “Scapegoat trees.” in SODA , vol. 93, 1993, pp. 165–174
1993
Earlier work this paper cites.
P. Chanzy, L. Devroye, and C. Zamora-Cura, “Analysis of range search for random kd trees,” Acta informatica , vol. 37, no. 4-5, pp. 355–383, 2001
2001
Earlier work this paper cites.
O. Procopiuc, P. K. Agarwal, L. Arge, and J. S. Vitter, “Bkd-tree: A dynamic scalable kd-tree,” in International Symposium on Spatial and Temporal Databases . Springer, 2003, pp. 46–65
2003
Earlier work this paper cites.
W. Hunt, W. R. Mark, and G. Stoll, “Fast kd-tree construction with an adaptive error-bounded heuristic,” in 2006 IEEE Symposium on Interactive Ray Tracing . IEEE, 2006, pp. 81–88
2006
Cited alongside, same era.
S. Popov, J. Gunther, H.-P. Seidel, and P. Slusallek, “Experiences with streaming construction of sah kd-trees,” in 2006 IEEE Symposium on Interactive Ray Tracing . IEEE, 2006, pp. 89–94
2006
Cited alongside, same era.
A. Nuchter, K. Lingemann, and J. Hertzberg, “Cached kd tree search for icp algorithms,” in Sixth International Conference on 3-D Digital Imaging and Modeling (3DIM 2007) . IEEE, 2007, pp. 419–426
2007
Cited alongside, same era.
M. Shevtsov, A. Soupikov, and A. Kapustin, “Highly parallel fast kd-tree construction for interactive ray tracing of dynamic scenes,” Computer Graphics Forum , vol. 26, no. 3, pp. 395–404, 2007
2007
Cited alongside, same era.
J. Ichnowski and R. Alterovitz, “Fast nearest neighbor search in se (3) for sampling-based motion planning,” in Algorithmic Foundations of Robotics XI . Springer, 2015, pp. 197–214
2015
Later among the works it cites.
F. Gao and S. Shen, “Online quadrotor trajectory generation and autonomous navigation on point clouds,” in 2016 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR) . IEEE, 2016, pp. 139–146
2016
Later among the works it cites.
B. T. Lopez and J. P. How, “Aggressive 3-d collision avoidance for high-speed navigation.” in ICRA , 2017, pp. 5759–5765
2017
Later among the works it cites.
T. Shan and B. Englot, “Lego-loam: Lightweight and ground-optimized lidar odometry and mapping on variable terrain,” in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2018, pp. 4758–4765
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
K. Zhou, Q. Hou, R. Wang, and B. Guo, “Real-time kd-tree construction on graphics hardware,” ACM Transactions on Graphics , vol. 27, no. 5, pp. 1–11, 2008
2008
Cited alongside, same era.
A. Segal, D. Haehnel, and S. Thrun, “Generalized-icp.” in Robotics: science and systems , vol. 2, no. 4. Seattle, WA, 2009, p. 435
2009
Cited alongside, same era.
M. Muja and D. G. Lowe, “Fast approximate nearest neighbors with automatic algorithm configuration.” VISAPP (1) , vol. 2, no. 331-340, p. 2, 2009
2009
Cited alongside, same era.
M. Muja and D. Lowe, “Flann-fast library for approximate nearest neighbors user manual,” Computer Science Department, University of British Columbia, Vancouver, BC, Canada , 2009
2009
Cited alongside, same era.
R. B. Rusu and S. Cousins, “3d is here: Point cloud library (pcl),” in 2011 IEEE international conference on robotics and automation . IEEE, 2011, pp. 1–4
2011
Cited alongside, same era.
J. Zhang and S. Singh, “Loam: Lidar odometry and mapping in real-time.” in Robotics: Science and Systems , vol. 2, no. 9, 2014
2014
Cited alongside, same era.
P. R. Florence, J. Carter, J. Ware, and R. Tedrake, “Nanomap: Fast, uncertainty-aware proximity queries with lazy search over local 3d data,” in 2018 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2018, pp. 7631–7638
2018
Later among the works it cites.
F. Gao, W. Wu, W. Gao, and S. Shen, “Flying on point clouds: Online trajectory generation and autonomous navigation for quadrotors in cluttered environments,” Journal of Field Robotics , vol. 36, no. 4, pp. 710–733, 2019
2019
Later among the works it cites.
J. Lin and F. Zhang, “Loam livox: A fast, robust, high-precision lidar odometry and mapping package for lidars of small fov,” in 2020 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2020, pp. 3126–3131
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.