Alternatives and similar repositories for sutherland-hodgman

Users that are interested in sutherland-hodgman are comparing it to the libraries listed below

• rgl-epfl / cholespy
  An easily integrable Cholesky solver on CPU and GPU
  ☆252Updated last week
• alecjacobson / geometry-processing-curvature
  Curvature assignment for Geometry Processing course
  ☆157Updated 2 years ago
• AIS-Bonn / easy_pbr
  Lightweight Physically-Based Renderer designed for ease of use and fast prototyping
  ☆115Updated 2 years ago
• davidstutz / mesh-evaluation
  Efficient C++ implementation of mesh-to-mesh and mesh-to-point distance.
  ☆60Updated 7 years ago
• nmwsharp / nonmanifold-laplacian
  A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]
  ☆147Updated last year
• fwilliams / numpyeigen
  Fast zero-overhead bindings between NumPy and Eigen
  ☆143Updated 9 months ago
• tovacinni / sdf-explorer
  This is accompanying code for our JCGT / I3D paper, "A Dataset and Explorer for 3D Signed Distance Functions (SDF)".
  ☆272Updated 3 years ago
• patr-schm / TinyAD
  Automatic Differentiation in Geometry Processing Made Simple
  ☆415Updated 2 months ago
• sgsellan / gpytoolbox
  A collection of utility functions to prototype geometry processing research in python
  ☆253Updated 3 months ago
• nmwsharp / polyscope-py
  Python bindings for Polyscope
  ☆50Updated last week
• skoch9 / meshplot
  Plot 3D triangle meshes
  ☆152Updated last year
• nmwsharp / flip-geodesics-demo
  Construct geodesic paths, loops, networks on surface with a fast and simple edge flipping algorithm. C++ demo app and more.
  ☆108Updated 2 years ago
• orzzzjq / Parallel-Banding-Algorithm-plus
  Compute the exact Euclidean Distance Transform and Voronoi Diagram for 2D and 3D binary images using the GPU.
  ☆79Updated 5 years ago
• chadogome / OptimalOBB
  Optimal Oriented Bounding Boxes algorithms
  ☆50Updated 7 years ago
• johnarobinson77 / KdTreeGPU
  A gpu based implementation of a K-D Tree Builder
  ☆118Updated 6 years ago
• amanshenoy / mesh-viewer
  An interactive mesh viewer (for '.obj' files) using OpenGL and GLSL
  ☆45Updated 2 years ago
• pyvista / fast-simplification
  Fast Quadratic Mesh Simplification
  ☆182Updated last week
• fwilliams / surface-reconstruction-benchmark
  A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al
  ☆53Updated last year
• Philip-Trettner / probabilistic-quadrics
  Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"
  ☆58Updated last year
• rgl-epfl / fastsweep
  Efficient Eikonal equation solver using CUDA
  ☆102Updated 3 months ago
• ifsheldon / stannum
  Fusing Taichi into PyTorch
  ☆144Updated 2 years ago
• nmwsharp / intrinsic-triangulations-tutorial
  An introductory course intrinsic triangulations for powerful & robust geometry processing --- tutorial code and links.
  ☆141Updated 3 years ago
• sxyu / sdf
  Parallelized triangle mesh --> continuous signed distance field on CPU
  ☆513Updated 2 years ago
• mrakotosaon / diff-surface-triangulation
  ☆108Updated 3 years ago
• Magnus2 / MeshSdf
  Signed Distance Function from triangle mesh.
  ☆95Updated 6 years ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆174Updated 7 years ago
• zishun / awesome-geometry-processing
  ☆163Updated last year
• skanti / generate-watertight-meshes-and-sdf-grids
  Generate watertight meshes and sdf grids from degenerate, non-manifold meshes
  ☆108Updated 2 years ago
• nmwsharp / robust-laplacians-py
  Build high-quality Laplace matrices on meshes and point clouds in Python. Implements [Sharp & Crane SGP 2020].
  ☆253Updated last year
• swapnil96 / Convex-hull
  Convex hull of given 3D points
  ☆94Updated 4 years ago