w8r / orourke-compc
Code from O'Rourke book "Computational Geometry algorithms in C" 1997
☆30Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for orourke-compc
- an elegant, high-performance and user-friendly halfedge data structure☆81Updated 3 years ago
- A header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes☆133Updated 2 years ago
- TinyMesh is a light-weight mesh processing library in C/C++.☆92Updated 11 months ago
- ☆38Updated 2 years ago
- A light-weighted, efficient and header-only mesh processing frame work.☆49Updated 2 years ago
- Computer Graphics Assignment about Bounding Volume Hierarchies☆124Updated 2 years ago
- Indirect Predicates for Geometric Constructions☆42Updated 7 months ago
- This is a mirror of the latest stable version of Triangle.☆127Updated 2 years ago
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆48Updated 2 months ago
- Signed Distance Function from triangle mesh.☆91Updated 5 years ago
- This is the header-only version of the code we used for the experiments in the paper "Fast and Robust Mesh Arrangements using Floating-po…☆147Updated 7 months ago
- ☆12Updated 3 years ago
- The code of lesson “Digital Geometry Processing” with ACAM frame☆131Updated 3 years ago
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆164Updated 3 months ago
- MeshDGP is a framework for processing mesh data in computer graphics☆38Updated 8 years ago
- C++ math / geometry / mesh processing library☆56Updated 6 years ago
- An implementation of Large Steps in Cloth Simulation for CSE328☆25Updated 7 years ago
- C++ implementation of the Marching Cubes algorithm☆36Updated 2 years ago
- A single-header C++ library of angle-based flattening algorithms (mirror repository)☆45Updated 8 months ago
- an implementation of parallel linear BVH (LBVH) on GPU☆182Updated 4 years ago
- An implemetation of lossless, efficient progressive mesh algorithm.☆17Updated last year
- 3D polygonal mesh renderer with dynamic level-of-detail (LOD).☆66Updated 4 years ago
- A C++ half-edge data structure for a triangle mesh with no external dependencies whatsoever. Public domain.☆115Updated 12 years ago
- Project for CSE528☆29Updated 2 years ago
- ☆22Updated last year
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆145Updated 6 years ago
- Cut a tetrahedral mesh with a triangle mesh in 3D.☆78Updated 3 years ago
- A C++ geometry processing library☆48Updated 3 years ago
- ☆47Updated 5 years ago
- Isotropic Remeshing of Triangulated Surface☆85Updated last year