Cubical Marching Squares animated скачать в хорошем качестве

Cubical Marching Squares animated

This video animates the Cubical Marching Squares (CMS) algorithm. The video is based on the following paper from 2005: Cubical Marching Squares: Adaptive Feature Preserving Surface Extraction from Volume Data https://www.csie.ntu.edu.tw/~cyy/publ... My CMS implementation in C# can be found here: https://github.com/metalisai/Aviz.Cms The video should've gone into more detail what I mean by inverting 2x2 and 3x3 matrices. The idea is to find x from matrix equation 'Ax=b', where A is a matrix composed of variable multipliers (normals), b is the vector of constant terms of plane equations and x is the vertex coordinates we're looking for. Multiplying both sides we get `A^(-1)Ax=A^(-1)b` or `x=A^(-1)b`. If the matrix isn't invertible then we can use the pseudo-inverse instead 'x≈A^(+)b` to find the least squares best fit. The voice is AI Text-To-Speech, not cloned from anyone's voice, but random. The visuals are made with my own animation framework and edited with Kdenlive. Constructive feedback or questions are welcome. 0:00 Intro 0:13 CMS basics 1:04 Cube meshing example 1:44 CMS 2D sharp feature 2:40 CMS 3D sharp feature 4:35 CMS Face ambiguity 5:13 CMS Internal ambiguity 6:02 Step 1: Hermite data 6:40 Step 2: Octree 6:52 Step 3: Adaptive subdivision 8:00 Step 4: Evaluate leaf faces 8:35 Step 5: Extract surface 9:20 Final mesh 9:30 Example meshes 9:41 MC vs CMS