SaaSHub helps you find the best software and product alternatives Learn more →
Top 13 C++ geometry-processing Projects
-
-
geometrize
:white_square_button: Geometrize is a desktop app that geometrizes images into geometric primitives
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
-
-
cinolib
A generic programming header only C++ library for processing polygonal and polyhedral meshes
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
-
3dmatch-toolbox
3DMatch - a 3D ConvNet-based local geometric descriptor for aligning 3D meshes and point clouds.
-
-
-
Project mention: Geometrize: Render Images as Geometric Primitives | news.ycombinator.com | 2023-06-13
Project mention: Voronoi Diagram and Delaunay Triangulation in O(nlog(n)) (2020) | news.ycombinator.com | 2023-10-25Interesting question! By virtue of being a tree, the MST produces at most 3 edges coming out of any vertex, so this should be the same in 3D. The MST then adds (sometimes) a 4th edge, so, although you could build both graphs in 3D space, you would still end up with 4 edges coming out of any vertex, I think.
In 3D space the Delaunay triangulation would produce a bunch of irregular tetrahedra, so the edges coming out from every vertex would vary between a minimum of 3, and a maximum of 12, if I get it right (ref: [1] :-).
The 3D Voronoi cells are another story... I found some implementation that you can play with to see how it looks [2] [3], each cell is of a shape called "convex polytope". It feels like these cells are packed like each of the sub-cubes of a rubik, but I'm not 100% sure :-) ... if that's true, you could jump from each vertex to the next in at most 17 directions? (hand-waves :-p)
--
1: https://en.wikipedia.org/wiki/Tetrahedron#/media/File:M_tic....
2: https://github.com/BrunoLevy/geogram/wiki/Delaunay3D
3: https://math.lbl.gov/voro++/examples/
For 3D visualisation I use Easy3D by Professor Nan: https://github.com/LiangliangNan/Easy3D
NOTE:
The open source projects on this list are ordered by number of github stars.
The number of mentions indicates repo mentiontions in the last 12 Months or
since we started tracking (Dec 2020).
C++ geometry-processing related posts
- Geogram: Programming Library with Geometric Algorithms
- Simple mesh library seeking advice and feedback
- MCUT: A simple and fast library for mesh booleans
- Anybody else would like a | unary operator?
- A simple, fast and robust C++ library for mesh booleans and more ...
- Project Lagrange: Robust Geometry Processing Library
- Best realtime mesh library?
-
A note from our sponsor - SaaSHub
www.saashub.com | 23 Apr 2024
Index
What are some of the best open-source geometry-processing projects in C++? This list will help you:
| Project | Stars | |
|---|---|---|
| 1 | CGal | 4,534 |
| 2 | geometrize | 1,822 |
| 3 | PyMesh | 1,797 |
| 4 | geogram | 1,603 |
| 5 | Easy3D | 1,260 |
| 6 | pmp-library | 1,202 |
| 7 | cinolib | 820 |
| 8 | 3dmatch-toolbox | 798 |
| 9 | mcut | 358 |
| 10 | lagrange | 246 |
| 11 | GraphiteThree | 202 |
| 12 | Directional | 167 |
| 13 | pyprt | 59 |
Sponsored
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com