I understand which edges are being deleted to make this happen, but how would this efficiently be completed in terms of restructuring the half-edge pointers?
aparikh98
I think we are essentially (wholly) removing 2 half edges and we are combining 2 sets of half edges/twins, and just cleaning up the related pointers
jsc723
I think we also need to remove 2 faces and 2 edges. Actually, we can start from figuring out which faces to delete, and then delete the correponding edges and half edges.
Staffantiamoeba
We'll talk about this process in discussion this week! If you can't make it, make sure to take a look at the discussion solutions.
amandaawan
If we're essentially reassigning all the pointers each time for correctness, would reassigning a lot of pointers each time rather than just the necessary ones like those around point m in this case make our program much slower?
I understand which edges are being deleted to make this happen, but how would this efficiently be completed in terms of restructuring the half-edge pointers?
I think we are essentially (wholly) removing 2 half edges and we are combining 2 sets of half edges/twins, and just cleaning up the related pointers
I think we also need to remove 2 faces and 2 edges. Actually, we can start from figuring out which faces to delete, and then delete the correponding edges and half edges.
We'll talk about this process in discussion this week! If you can't make it, make sure to take a look at the discussion solutions.
If we're essentially reassigning all the pointers each time for correctness, would reassigning a lot of pointers each time rather than just the necessary ones like those around point m in this case make our program much slower?