百科.dev
全部条目在线工具AI 编程趋势榜开源项目技术资讯提交条目
登录
< 返回工具列表
O

octree

> 编程语言
开源

使用 Octree 进行快速半径邻居搜索 (ICRA 2015)

377 stars0 点赞2 次浏览
访问官网GitHub

工具介绍

使用 Octree 进行快速半径邻居搜索 (ICRA 2015)

Efficient Radius Neighbor Search in Three-dimensional Point Clouds

This repository provides the Octree implementation of the paper "Efficient Radius Neighbor Search in Three-dimensional Point Clouds" by J. Behley, V. Steinhage, and A.B. Cremers, University of Bonn presented at the IEEE International Conference on Robotics and Automation (ICRA), 2015.

Features

  • Fast radius neighbor search for three-dimensional point clouds.
  • Fully templated for maximal flexibility to support arbitrary point representations & containers
  • Supports arbitrary p-norms: L1, L2 and Maximum norm included.
  • Nearest neighbor search with arbitrary norms (added 25. November 2015).

Building the examples & tests

The octree itself has no dependencies. However, for compiling the examples, you need CMake and Boost C++ library. For building the examples you have to first build the project:

bash
mkdir build
cd build
cmake ..
make

To run the examples, you need some point cloud data:

bash
wget http://jbehley.github.io/data/wachtberg_folds.zip
unzip wachtberg_folds.zip -d data

Now you can run the examples:

bash
./example1 data/scan_001_points.dat

which perform some queries and demonstrate the flexibility of our Octree implementation to handle different implementations of points.

The different examples show some use cases of the octree. example1 demonstrates the general usage with point data types providing public access to x,y,z coordinates. example2 shows how to use a different point type, which non-public coordinates. example3 shows how to use the templated method inside an also templated descriptor.

We also provide a test case using the Google Test Framework (GTest), which is automatically build if the package is either found by Cmake or in the corresponding source directory, e.g., /usr/src/gtest/. You can invoke the testsuite with

bash
./octree-test

Contact

Feel free to contact me (see also my academic homepage) if you have questions regarding the implementation.

Attribution

If you use the implementation or ideas from the corresponding paper in your academic work, it would be nice if you cite the corresponding paper:

J. Behley, V. Steinhage, A.B. Cremers. Efficient Radius Neighbor Search in Three-dimensional Point Clouds, Proc. of the IEEE International Conference on Robotics and Automation (ICRA), 2015.

The BibTeX entry for the paper is::

@conference{behley2015icra,
     author = {Jens Behley and Volker Steinhage and Armin B. Cremers},
      title = {{Efficient Radius Neighbor Seach in Three-dimensional Point Clouds}},
  booktitle = {Proc. of the IEEE International Conference on Robotics and Automation (ICRA)},
       year = {2015}
}

License

Copyright 2015 Jens Behley, University of Bonn.

This project is free software made available under the MIT License. For details see the LICENSE file.

Issues· 0 开放

查看全部 Issues在 GitHub 打开

暂无开放 Issues,或尚未同步最近议题。

> 标签

C++icra2015octree

暂无评论,来聊聊你的看法吧

> 工具信息

发布日期2026年8月1日
最后更新2026年9月17日
分类编程语言
定价开源

> 相关工具

T
TypeScript
JavaScript 的超集,为前端与全栈提供静态类型
P
Python
通用编程语言,广泛用于 Web、数据与 AI
G
Go
Google 推出的简洁高效系统语言