w8r / orourke-compcLinks
Code from O'Rourke book "Computational Geometry algorithms in C" 1997
☆34Updated 8 years ago
Alternatives and similar repositories for orourke-compc
Users that are interested in orourke-compc are comparing it to the libraries listed below
Sorting:
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆176Updated 7 years ago
- Fearless Boolean operations on triangle meshes 🛌💤☆47Updated 8 months ago
- Closed 3D Triangle Mesh Boolean Operation Library☆26Updated 4 years ago
- Signed Distance Function from triangle mesh.☆95Updated 6 years ago
- TinyMesh is a light-weight mesh processing library in C/C++.☆100Updated 2 years ago
- A simple, easily hackable C++ surface voxelizer (STL=>voxels)☆180Updated 4 years ago
- 3D polygonal mesh renderer with dynamic level-of-detail (LOD).☆68Updated 5 years ago
- Dual Contouring Implementation in C++, by Tao Ju, from http://sourceforge.net/projects/dualcontouring/☆71Updated 11 years ago
- A light-weighted, efficient and header-only mesh processing frame work.☆57Updated 3 years ago
- Acceleration structure library (BVH-, KD-Tree) with basic parallel construction☆56Updated 7 years ago
- C++ math / geometry / mesh processing library☆63Updated 7 years ago
- Computer Graphics Assignment about Bounding Volume Hierarchies☆132Updated 4 years ago
- Construct geodesic paths, loops, networks on surface with a fast and simple edge flipping algorithm. C++ demo app and more.☆108Updated 2 years ago
- A simple octree with good commenting for learning how octrees work.☆263Updated 3 years ago
- An algorithm for Structured Volume Decomposition☆39Updated 10 months ago
- Reference Implementation of Automatic UV Mapping with Harmonic Maps.☆25Updated 9 years ago
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆180Updated 2 months ago
- Fast and light-weight Marching Cubes library in C++ without any dependencies.☆179Updated 8 years ago
- an elegant, high-performance and user-friendly halfedge data structure☆89Updated 5 years ago
- Robust geometric predicates☆64Updated last year
- Computer Graphics Assignment about Meshes☆27Updated 6 years ago
- A Constrained Resampling Strategy for Mesh Improvement - SGP 2017☆59Updated 4 years ago
- Measuring Error between Surface using the Hausdorff distance☆17Updated 14 years ago
- 2D Delaunay triangulation (dela) - super stable (bella!)☆250Updated last year
- A C++ half-edge data structure for a triangle mesh with no external dependencies whatsoever. Public domain.☆117Updated 14 years ago
- A simplicial mesh structure that supports general non-manifold meshes and associated data☆40Updated 12 years ago
- A nano spline library in modern C++.☆130Updated last month
- A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator by Jonathan Richard Shewchuk☆38Updated 5 years ago
- A header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes☆148Updated 10 months ago
- Guaranteed-robust intrinsic triangulations for surface mesh processing! (C++ demo app)☆32Updated 2 years ago