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. Learn more →
Top 23 geometry-processing Open-Source Projects
-
-
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.
-
geometrize
:white_square_button: Geometrize is a desktop app that geometrizes images into geometric primitives
-
-
PIFu
This repository contains the code for the paper "PIFu: Pixel-Aligned Implicit Function for High-Resolution Clothed Human Digitization"
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
-
-
-
cinolib
A generic programming header only C++ library for processing polygonal and polyhedral meshes
-
3dmatch-toolbox
3DMatch - a 3D ConvNet-based local geometric descriptor for aligning 3D meshes and point clouds.
-
-
-
-
lox
Fast polygon mesh library with different data structures and traits to abstract over those. (by LukasKalbertodt)
-
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
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
Project mention: Show HN: Checkers Twist – The game Checkers/Draughts/Dames on an irregular grid | news.ycombinator.com | 2024-05-03- some corners will connect less than 4 tiles. This does the opposite of the previous point, as this removes diagonals. This limits your moves in a specific direction, but can also protect you from your opponents. It's the kind of features that can be used both as a defense and as attack.
And the boards are procedurally generated, so you can play unique games each time (or you can re-use the same boards if you like). It is done with my engine Polygonjs ( https://polygonjs.com/ ), and if you're curious about how the grid is built, here is an example scene you can play with: https://polygonjs.com/gui/irregular_quad_relaxation/edit .
The game is not free on Steam/iOS, but the demo has no time limit, it just gives you a handful of boards to play with.
I hope that's fun!
- Trailer: https://www.youtube.com/watch?v=GAfUvwuLueI
So in other Julia geometry-related projects that may be true, but for this particular corner of the ecosystem the main author (Júlio Hoffimann) has actually implemented much of the underlyin code from scratch (to the best of my understanding) in pure Julia in a whole set of packages, including
https://github.com/JuliaGeometry/Meshes.jl
Project mention: Ran out of time for ProcJam this year, but ended up adding vector array support to my mesh generation software so multiple people can build paths together in real-time, as well as download the models that were created. | /r/proceduralgeneration | 2023-12-10
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).
geometry-processing related posts
-
Voronoi Diagram and Delaunay Triangulation in O(nlog(n)) (2020)
-
Geospatial Data Science with Julia
-
`lox` - a fast polygon mesh library with different mesh data structures and traits to abstract over those
-
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 note from our sponsor - InfluxDB
www.influxdata.com | 5 May 2024
Index
What are some of the best open-source geometry-processing projects? This list will help you:
| Project | Stars | |
|---|---|---|
| 1 | pointnet | 4,574 |
| 2 | CGal | 4,558 |
| 3 | geometrize | 1,822 |
| 4 | PyMesh | 1,813 |
| 5 | PIFu | 1,734 |
| 6 | geogram | 1,605 |
| 7 | Easy3D | 1,270 |
| 8 | pmp-library | 1,206 |
| 9 | text2mesh | 908 |
| 10 | cinolib | 825 |
| 11 | 3dmatch-toolbox | 800 |
| 12 | voxelizer | 610 |
| 13 | polygonjs | 545 |
| 14 | mcut | 362 |
| 15 | Meshes.jl | 359 |
| 16 | lagrange | 246 |
| 17 | GraphiteThree | 205 |
| 18 | Directional | 169 |
| 19 | PGS | 149 |
| 20 | lox | 70 |
| 21 | polyform | 62 |
| 22 | pyprt | 59 |
| 23 | neatmesh | 10 |
Sponsored
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com