Home Projects TEASER-plusplus
TEASER-plusplus
C++

TEASER-plusplus

A fast and robust point cloud registration library

by MIT-SPARK · GitHub
Stars
Forks
License
Created
Last commit
Language
3d-reconstruction3d-registrationoptimizationMITC++
View on GitHub
In plain words

Align and match 3D point clouds accurately, even with noisy data.

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 →
TEASER-plusplus — GitHub preview card
📈 Star history
2 3172 316
2026-07-202026-08-31
📈 Track TEASER-plusplus

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

A fast and robust point cloud registration library

TEASER-plusplus has 2.3k stars on GitHub. It has been forked 414 times. TEASER-plusplus is written mainly in C++. It has been in active development since 2020. TEASER-plusplus is available under the MIT license. Its main topics are 3d-reconstruction, 3d-registration, optimization, point-clouds.

Frequently asked questions

What is TEASER-plusplus?

A fast and robust point cloud registration library

Is TEASER-plusplus open source?

TEASER-plusplus is an open-source project. It is released under the MIT license.

Is TEASER-plusplus free?

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

What license does TEASER-plusplus use?

TEASER-plusplus is available under the MIT license.

What language is TEASER-plusplus written in?

TEASER-plusplus is written mainly in C++.

🏅 Maintainer of this project?
olud.ai badge — TEASER-plusplus

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

[![olud.ai](https://olud.ai/badge.php?tool=mit-spark-teaser-plusplus)](https://olud.ai/project/mit-spark-teaser-plusplus.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.