jbegaint / delaunay-cpp
C++11 Delaunay triangulation implementation (Bowyer-Watson)
☆84Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for delaunay-cpp
- learn cgal by demo☆185Updated 5 years ago
- delaunay triangulation in 3D space, to reconstruct convex hull from spherical dot cloud☆73Updated 5 years ago
- Efficient Large-Scale Point-Cloud Viewer based on OpenGL☆81Updated 4 years ago
- C++ version the delaunay triangulation☆442Updated 4 years ago
- Fast radius neighbor search with an Octree (ICRA 2015)☆351Updated 4 years ago
- Mesh Simplification based on edge-collapse algorithm☆127Updated last year
- C++ library and set of utilities for input, output, and basic manipulation of 3D triangle meshes☆309Updated last year
- Git mirror of the geogram library by INRIA☆123Updated 2 years ago
- KDTree library☆113Updated 14 years ago
- ☆65Updated 10 years ago
- OSG中，计算模型的OBB包围盒和AABB包围盒并绘制☆30Updated 5 years ago
- B-Spline surface (Qt & OpenGL)☆22Updated 6 years ago
- C++ port of mapbox's JS concaveman, with a Python wrapper☆153Updated last year
- Simplified QSlim Library Code Blocks (QSlim库简化版本，兼容了标准Mesh定义，剥离了冗余代码)☆16Updated 10 years ago
- A simple octree with good commenting for learning how octrees work.☆253Updated 2 years ago
- Simple C++ KD-Tree implementation☆196Updated last month
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆143Updated 6 years ago
- OpenSceneGraph 3.0 - Beginner's Guide 源码☆21Updated 5 months ago
- A really fast C++ library for Delaunay triangulation of 2D points☆154Updated last month
- The code of lesson “Digital Geometry Processing” with ACAM frame☆131Updated 3 years ago
- Dragon is a library about geometry processing.☆35Updated last month
- C++ library for NURBS curves and surfaces☆452Updated 4 months ago
- A really fast C++ library for Delaunay triangulation of 2D points☆519Updated 9 months ago
- B Spline curve interpolation and least squares fit cubic spline smoothing interpolation, refer THE NURBS BOOK☆29Updated 4 years ago
- This is an implementation of the progressive meshes based on the mesh simplification algorithm proposed by Garland and Heckbert.☆22Updated 10 years ago
- Implementation of the Bowyer-Watson algorithm (with modified Lloyd relaxation) for finding Delaunay triangulations of point sets on the u…☆15Updated 6 years ago
- This code is used to implement the Delaunay triangulation algorithm and visualize☆14Updated 4 years ago
- Divide and Conquer Algorithm for Delaunay Triangulation in 2D space☆19Updated last year
- Implementation of Surface Simplification Using QEM in C++.☆27Updated 6 months ago
- 3D polygonal mesh renderer with dynamic level-of-detail (LOD).☆66Updated 4 years ago