ulatich

6 ms·

1. 1.▲
   by ulatich 3y ago

   There is also the “Binary Ostensibly-Implicit Tree”. Like Eytzinger‘s tree/method but without the need to pad memory. Generalises to n-ary trees too.
2. 2.▲
   Isotropic ARAP energy using Cauchy-Green invariants(dl.acm.org)

   1 points by ulatich 4y ago|0 comments
3. 3.▲
   MCUT: A simple and fast library for mesh booleans(github.com)

   2 points by ulatich 4y ago|1 comments
4. 4.▲
   by ulatich 4y ago

   MCUT is a library for cutting 3D mesh objects using their geometry to produce crisp fragments at fine scale, which is useful for operations like slicing and boolean operations (union, subtraction and intersection).
5. 5.▲
   A fast and robust library for general mesh cutting in C++(cutdigital.github.io)

   3 points by ulatich 5y ago|1 comments
6. 6.▲
   by ulatich 5y ago

   MCUT is a tool providing a general solution to the problem of resolving mesh intersections.