Discrete Differential Geometry Assignment 0
DDG Week2 Writing Assignment
Show that for any polygonal disk.
For a simple n-sided polygon with n vertices, n edges, and 1 face, the equation above holds. When conncting another n-sided polygon to form a disk, the polygon can connect to the existing disk by merging edges. This will generate edges, vertices, and 1 new face.
The last equality stems from our inductive assumption.
In a platonic solid, there are m, n-gons meeting at vertices.
A0 = [ [1,1,0,0,0], [1,0,1,0,0], [1,0,0,1,0], [1,0,0,0,1], [0,1,0,0,1], [0,1,1,0,0], [0,0,1,1,0], [0,0,0,1,1] ]
A1 = [ [1,0,0,1,1,0,0,0], [1,1,0,0,0,1,0,0], [0,1,1,0,0,0,1,0], [0,0,1,1,0,0,0,1] ]
Code is somewhere, I haven't decided where to put it. The screenshots below should verify that the c++ code is working to solve the exercises.
All tests green: