Home Projects open3d_slam
open3d_slam
C++

open3d_slam

Pointcloud-based graph SLAM written in C++ using open3D library.

by leggedrobotics · GitHub
Stars
Forks
Created
Last commit
Category
Language
Likely
Self-hostable
cpplidarlocalizationBSD-3-ClauseC++Self-hostable
View on GitHub
In plain words

Build maps or locate positions using point cloud data in robotics projects.

You maintain this project?

Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.

Claim this page →
open3d_slam — GitHub preview card
📈 Star history
623622
2026-07-202026-08-31
📈 Track open3d_slam

Get an email alert on its next release or when it starts trending — never miss the moment.

Free · no card · unsubscribe anytime
Get email alerts →
📄 About

Pointcloud-based graph SLAM written in C++ using open3D library.

open3d_slam has 622 stars on GitHub. It has been forked 61 times. open3d_slam is written mainly in C++. It has been in active development since 2022. open3d_slam is available under the BSD-3-Clause license. Its main topics are cpp, lidar, localization, mapping.

Frequently asked questions

What is open3d_slam?

Pointcloud-based graph SLAM written in C++ using open3D library.

Is open3d_slam open source?

open3d_slam is an open-source project. It is released under the BSD-3-Clause license.

Is open3d_slam free?

Yes. open3d_slam is free and open source — you can use, modify and self-host it.

What license does open3d_slam use?

open3d_slam is available under the BSD-3-Clause license.

What language is open3d_slam written in?

open3d_slam is written mainly in C++.

🏅 Maintainer of this project?
olud.ai badge — open3d_slam

Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.

[![olud.ai](https://olud.ai/badge.php?tool=leggedrobotics-open3d-slam)](https://olud.ai/project/leggedrobotics-open3d-slam.html)
More badge options →
🧬 Shares DNA with🧬 View the DNA map →

Measured from GitHub topics shared by both projects, weighted by how rare each topic is.