Open3D: A Modern Library for 3D Data Processing
- mesh-processing
- computer-graphics
- opengl
- cpp
54,641 visible repositories in the index
1–19 of 19 · Most stars
Open3D: A Modern Library for 3D Data Processing
Draco is a library for compressing and decompressing 3D geometric meshes and point clouds. It is intended to improve the storage and transmission of 3D graphics.
The public CGAL repository, see the README below
A collection of GICP-based fast point cloud registration algorithms
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh simplification, etc
A lean C++ library for working with point cloud data
Geometry, simplified.
Polygonal Surface Reconstruction from Point Clouds (C++ & Python)
Qhull development for www.qhull.org -- Qhull 2020.2 (8.1-alpha1) at https://github.com/qhull/qhull/wiki
A C implementation for creating 2D Voronoi/Delauney diagrams
The Point Processing Toolkit (pptk) is a Python package for visualizing and processing 2-d/3-d point clouds.
A simple script for fracturing polygons. Also adds nice helper functions for polygons like calculateArea, triangulate, getRandomPointsInPolygon, getBoundingRect)
Voronoi / Delaunay tessellations on the sphere
D3 plugin which computes a treemap based on a Voronoi tesselation
:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go
:spider_web: Compute interesting points, areas, and volumes in simplex meshes of any dimension.
A GDScript port of Delaunator: A fast library for Delaunay triangulation of 2D points.
Tiny header-only C++17 library for lat/lng geometry: distance, bearing, area, point-in-polygon and path proximity
2D triangulation library. Allows translating lines and polygons (both based on points) to the language of GPUs.