2 ms·
For me I'm trying to visualize tetrahedral-like shapes and finding what needs to be the "inside" and "outside" of these to eliminate crossings.
by ironSkillet 3y ago
For me I'm trying to visualize tetrahedral-like shapes and finding what needs to be the "inside" and "outside" of these to eliminate crossings.
- albert_e 3y agoYes that too. In most cases I was able to imagine the nodes as lying on a fabric (stiched in the form of a tube) that can be turned inside out. And there are two "ends" to this. There is one subset of points that describes the upper opening of the tube, and there is another subset that describes the lower opening. Our job is to arrange the points such that we are looking down through the upper opening and can see all the way through into the empty space through the lower opening. In this solved state, the upper opening becomes the outermost permit error of the solved graph, and lower opening becomes the inner most / smallest enclosed space inside the solved graph. Rest of the points are just extra points on the fabric itself that should "stay in view".