v-hill / parallel-delaunayLinks
Parallel implementation of Guibas & Stolfi's divide-and-conquer algorithm for Delaunay triangulation, using MPI in Python.
☆15Updated 9 months ago
Alternatives and similar repositories for parallel-delaunay
Users that are interested in parallel-delaunay are comparing it to the libraries listed below
Sorting:
- ☆36Updated 11 months ago
- JIGSAW is a Delaunay-based unstructured mesh generator for two- and three-dimensional geometries.☆165Updated 5 months ago
- This is a mirror of the latest stable version of Tetgen.☆107Updated 9 months ago
- Compute interesting points, areas, and volumes in simplex meshes of any dimension.☆108Updated 5 months ago
- A python library for fast prototyping in geometry processing.☆34Updated 2 years ago
- Capacity-Constrained Voronoi Tessellations☆22Updated 10 years ago
- 📐🔍 Mesh quality inspector☆14Updated 2 years ago
- Geometry-preserving Adaptive Mesher☆34Updated last year
- Robust geometric predicates without the agonising pain.☆25Updated 2 months ago
- PinMesh is an exact and efficient parallel algorithm for preprocess a polyhedral triangular mesh and, then, query a cloud of points again…☆15Updated 9 years ago
- ☆12Updated last year
- 🧱 World leading open-source geometry engine in context of Implicit Surface Modelling, featuring sharp edges: Library for Geometric / Sol…☆27Updated this week
- Hybrid arithmetic for geometric computation☆18Updated 5 years ago
- ☆18Updated last year
- Fast Delaunay triangulation of 2D points implemented in Python.