Alternatives and similar repositories for sutherland-hodgman

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

• fwilliams / numpyeigen
  Fast zero-overhead bindings between NumPy and Eigen
  ☆143Updated 7 months ago
• alecjacobson / geometry-processing-curvature
  Curvature assignment for Geometry Processing course
  ☆157Updated 2 years ago
• nmwsharp / flip-geodesics-demo
  Construct geodesic paths, loops, networks on surface with a fast and simple edge flipping algorithm. C++ demo app and more.
  ☆106Updated 2 years ago
• rgl-epfl / cholespy
  An easily integrable Cholesky solver on CPU and GPU
  ☆250Updated this week
• 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
• patr-schm / TinyAD
  Automatic Differentiation in Geometry Processing Made Simple
  ☆409Updated 2 weeks ago
• tovacinni / sdf-explorer
  This is accompanying code for our JCGT / I3D paper, "A Dataset and Explorer for 3D Signed Distance Functions (SDF)".
  ☆267Updated 3 years ago
• skoch9 / meshplot
  Plot 3D triangle meshes
  ☆152Updated last year
• davidstutz / mesh-evaluation
  Efficient C++ implementation of mesh-to-mesh and mesh-to-point distance.
  ☆60Updated 6 years ago
• GouMinghao / Geometry3D
  Geometry3D: 3D Computational Geometrics Library
  ☆95Updated 8 months ago
• nmwsharp / nonmanifold-laplacian
  A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]
  ☆145Updated last year
• sgsellan / gpytoolbox
  A collection of utility functions to prototype geometry processing research in python
  ☆251Updated last month
• sxyu / meshview
  Simple OpenGL mesh/point cloud viewer
  ☆123Updated 2 years ago
• nmwsharp / intrinsic-triangulations-tutorial
  An introductory course intrinsic triangulations for powerful & robust geometry processing --- tutorial code and links.
  ☆138Updated 3 years ago
• pboechat / pyobb
  OBB implementation in python (using numpy)
  ☆81Updated last year
• nmwsharp / polyscope-py
  Python bindings for Polyscope
  ☆50Updated last month
• Magnus2 / MeshSdf
  Signed Distance Function from triangle mesh.
  ☆94Updated 6 years ago
• johnarobinson77 / KdTreeGPU
  A gpu based implementation of a K-D Tree Builder
  ☆116Updated 6 years ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆173Updated 7 years ago
• GeometryCollective / wost-simple
  Simple didactic code + tutorial for the Walk on Stars (WoSt) algorithm
  ☆97Updated 2 years ago
• chadogome / OptimalOBB
  Optimal Oriented Bounding Boxes algorithms
  ☆48Updated 6 years ago
• ifsheldon / stannum
  Fusing Taichi into PyTorch
  ☆145Updated 2 years ago
• amanshenoy / mesh-viewer
  An interactive mesh viewer (for '.obj' files) using OpenGL and GLSL
  ☆45Updated 2 years ago
• fwilliams / surface-reconstruction-benchmark
  A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al
  ☆53Updated last year
• cheind / sdftoolbox
  Vectorized Python methods for creating, manipulating and tessellating signed distance fields.
  ☆55Updated 2 years ago
• rohan-sawhney / zombie
  Grid-Free Monte Carlo Solvers for Partial Differential Equations
  ☆258Updated 2 months ago
• nzfeng / SWN
  C++ implementation of the Surface Winding Numbers algorithm, which computes inside-outside on general surfaces.
  ☆56Updated 10 months ago
• ilwoolyu / MeshLib
  Mesh Library (MeshLib) - A collection of C++ fundamental libraries for surface processing
  ☆49Updated 3 years ago
• nmwsharp / robust-laplacians-py
  Build high-quality Laplace matrices on meshes and point clouds in Python. Implements [Sharp & Crane SGP 2020].
  ☆249Updated 11 months ago
• jmespadero / pyDelaunay2D
  A simple Delaunay 2D triangulation in python (with numpy)
  ☆198Updated last year