SaaSHub helps you find the best software and product alternatives Learn more →
Top 17 mesh-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.
-
pyvista
3D plotting and mesh analysis through a streamlined interface for the Visualization Toolkit (VTK)
-
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
-
DicomToMesh
A command line tool to transform a DICOM volume into a 3d surface mesh (obj, stl or ply). Several mesh processing routines can be enabled, such as mesh reduction, smoothing or cleaning. Works on Linux, OSX and Windows.
-
AR-VR-Guide
A guide covering Augmented Reality (AR), Virtual Reality (VR), Mixed Reality(MR), and Extended Reality(XR). Including headsets such as Apple Vision Pro, HoloLens, PlayStation VR, and Quest 3.
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
Project mention: Does anyone else agree that the links to the latest development version of Open3D don't work? | /r/cscareerquestions | 2023-07-10I was going to file a bug about another issue, but I have to download the development version. This is why I want this solved quickly. None of the links seem to work: https://github.com/isl-org/Open3D/issues/6259
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/
mesh-processing related posts
-
Voronoi Diagram and Delaunay Triangulation in O(nlog(n)) (2020)
-
Does anyone else agree that the links to the latest development version of Open3D don't work?
-
More sleepy hollow pictures
-
3D Model to STL Woes
-
School project
-
Nanite-like LODs experiments
-
Will the same texture used in many gltfs be duplicated in memory?
-
A note from our sponsor - SaaSHub
www.saashub.com | 5 May 2024
Index
What are some of the best open-source mesh-processing projects? This list will help you:
Project | Stars | |
---|---|---|
1 | Open3D | 10,514 |
2 | meshoptimizer | 4,981 |
3 | CGal | 4,558 |
4 | meshlab | 4,436 |
5 | pyvista | 2,376 |
6 | geogram | 1,605 |
7 | glTF-Transform | 1,245 |
8 | pmp-library | 1,206 |
9 | cinolib | 825 |
10 | DicomToMesh | 410 |
11 | AR-VR-Guide | 372 |
12 | mcut | 362 |
13 | GraphiteThree | 205 |
14 | zmesh | 55 |
15 | proc-rock | 26 |
16 | csgjs-cpp | 13 |
17 | neatmesh | 10 |
Sponsored