mirsaeedi / spline-curve-fitting

Related projects: ⓘ

• Twinklebear / webgl-util
  A set of barebones utilities for playing with WebGL
  ☆16Updated 4 years ago
• weshoke / efficient-marching-cubes
  Implementation of Efficient implementation of Marching Cubes’ cases with topological guarantees
  ☆34Updated 3 years ago
• manubb / graph-draw
  Fast and accurate tessellation of planar graphs with convex polygons
  ☆17Updated 9 months ago
• mikolalysenko / split-polygon
  Splits a convex polygon by a plane
  ☆16Updated 10 years ago
• mikolalysenko / taubin-smooth
  Taubin's mesh smoothing algorithm implemented in JavaScript
  ☆36Updated 7 years ago
• StandardCyborg / nurbs
  Non-Uniform Rational B-Splines (NURBS) of any dimensionality
  ☆148Updated last year
• shortsleeves / visvalingam_simplify
  C++ Implementation of Visvalingam's algorithm (also known as Visvalingam Whyatt algorithm)
  ☆32Updated 3 years ago
• FlorisSteenkamp / MAT
  Medial Axis Transform - Library
  ☆117Updated 5 months ago
• m-schuetz / webgpu_pointcloud
  A WebGPU point cloud rendering example
  ☆35Updated 3 years ago
• mikolalysenko / glsl-read-float
  Read floating point values back from WebGL
  ☆42Updated 9 years ago
• geidav / ombb-rotating-calipers
  Computing oriented minimum bounding boxes using Rotating Calipers
  ☆37Updated 6 years ago
• marcosscriven / cgaljs
  A port of CGAL to Javascript
  ☆36Updated 7 years ago
• jahting / pnltri.js
  Polygon Near-Linear Triangulation in JavaScript (simple polygons with holes for now)
  ☆66Updated 9 years ago
• mikolalysenko / mesh-fixer
  Fixes holes in 3D meshes
  ☆20Updated 7 years ago
• cgalab / surfer2
  straight skeleton code implementing Aichholzer and Aurenhammer's Triangulation based algorithm
  ☆20Updated 3 years ago
• Twinklebear / webgpu-bcmc
  WebGPU Data-Parallel Block-Compressed Marching Cubes Isosurface Extraction
  ☆54Updated last year
• nWhovian / 3D-delaunay-triangulation
  Delaunay triangulation of a set of points in the three-dimensional space
  ☆9Updated 5 years ago
• dhmhd / poly-split
  Solving the problem of cutting a given polygon into any number of areas of given squares with a lines of minimal length
  ☆16Updated 3 years ago
• avaxman / MoebiusCode
  Demo for the SIGGRAPH 2015 paper: "Conformal Mesh Deformations with Möbius Transformations".
  ☆23Updated last year
• maxjiang93 / IsoOctree
  IsoOctree (Unix Port for Misha Kazhdan's original code)
  ☆14Updated 5 years ago
• matthiaskramm / gfxpoly
  stable polygon intersection
  ☆33Updated 4 years ago
• Eronana / rbush-3d
  RBush-3D — a high-performance JavaScript R-tree-based 3D spatial index for points and cuboids
  ☆83Updated last week
• arntanguy / mesh_sampling
  Samplers to obtain pointclouds from CAD meshes
  ☆16Updated 2 years ago
• wanadev / gltf-bounding-box
  Computes the global bounding box of a gltf model
  ☆20Updated 5 years ago
• OKaluza / sharevol
  Lightweight volume slicing and rendering in WebGL
  ☆32Updated 6 years ago
• momower1 / PointCloudEngine
  Point Cloud Rendering Engine with Octree Generation, Splat Blending, Phong Lighting and Neural Network Evaluation
  ☆9Updated last year
• mikolalysenko / haar-tree-3d
  3D Wavelet Rasterization
  ☆29Updated 7 years ago
• nepluno / RoundCornerBox
  A Single C++ Header Generating 3D Triangulated Rounded Corner Box
  ☆13Updated 7 years ago
• SINTEF-Geometry / TTL
  Triangulation Template Library
  ☆25Updated 6 years ago
• fferri / pcl-boolean-op
  Boolean operations (union, intersection, difference) on 3D Point Clouds
  ☆11Updated 9 years ago