Alternatives and similar repositories for sutherland-hodgman

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

• erwincoumans / pyrigidbody3d
  tiny toy rigid body sim in python
  ☆34Updated 3 years ago
• GouMinghao / Geometry3D
  Geometry3D: 3D Computational Geometrics Library
  ☆94Updated 6 months ago
• chadogome / OptimalOBB
  Optimal Oriented Bounding Boxes algorithms
  ☆48Updated 6 years ago
• alecjacobson / geometry-processing-curvature
  Curvature assignment for Geometry Processing course
  ☆156Updated 2 years ago
• fwilliams / numpyeigen
  Fast zero-overhead bindings between NumPy and Eigen
  ☆141Updated 5 months ago
• davidstutz / mesh-evaluation
  Efficient C++ implementation of mesh-to-mesh and mesh-to-point distance.
  ☆60Updated 6 years ago
• mortacious / cupy-knn
  A fast nearest neighbor index cuda implementation for 3-D points using a left balanced BVH-tree.
  ☆30Updated 7 months ago
• nmwsharp / polyscope-py
  Python bindings for Polyscope
  ☆49Updated 2 weeks ago
• pboechat / pyobb
  OBB implementation in python (using numpy)
  ☆81Updated last year
• nmwsharp / intrinsic-triangulations-tutorial
  An introductory course intrinsic triangulations for powerful & robust geometry processing --- tutorial code and links.
  ☆136Updated 3 years ago
• kip-hart / AABBTree
  Pure Python implementation of d-dimensional AABB tree.
  ☆67Updated 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.
  ☆106Updated 2 years ago
• cheind / sdftoolbox
  Vectorized Python methods for creating, manipulating and tessellating signed distance fields.
  ☆54Updated 2 years ago
• tovacinni / sdf-explorer
  This is accompanying code for our JCGT / I3D paper, "A Dataset and Explorer for 3D Signed Distance Functions (SDF)".
  ☆264Updated 3 years ago
• AIS-Bonn / easy_pbr
  Lightweight Physically-Based Renderer designed for ease of use and fast prototyping
  ☆113Updated 2 years ago
• patr-schm / TinyAD
  Automatic Differentiation in Geometry Processing Made Simple
  ☆405Updated 4 months ago
• jmespadero / pyDelaunay2D
  A simple Delaunay 2D triangulation in python (with numpy)
  ☆198Updated last year
• skoch9 / meshplot
  Plot 3D triangle meshes
  ☆152Updated last year
• ifsheldon / stannum
  Fusing Taichi into PyTorch
  ☆146Updated 2 years ago
• maksyuki / TaichiGAME
  GPU Accelerated Motion Engine based on Taichi Lang.
  ☆61Updated 3 years ago
• AIS-Bonn / stillleben
  Physics-based Scene Synthesis for Deep Learning
  ☆62Updated 3 years ago
• pyvista / fast-simplification
  Fast Quadratic Mesh Simplification
  ☆163Updated this week
• nmwsharp / gc-polyscope-project-template
  A template project to get started with geometry-central and Polyscope.
  ☆56Updated last year
• AudioSceneDescriptionFormat / splines
  Python package for creating interpolating splines (for position and rotation)
  ☆78Updated last week
• cppd / math
  The more dimensions, the better the geometry.
  ☆16Updated this week
• seung-lab / DracoPy
  Python wrapper for Google's Draco mesh compression library.
  ☆107Updated 3 weeks ago
• amanshenoy / mesh-viewer
  An interactive mesh viewer (for '.obj' files) using OpenGL and GLSL
  ☆44Updated last year
• qnzhou / nanospline
  A nano spline library in modern C++.
  ☆124Updated 10 months ago
• rgl-epfl / cholespy
  An easily integrable Cholesky solver on CPU and GPU
  ☆239Updated 9 months ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆165Updated 7 years ago