Loop cut through n-gons
Today it's impossible to make a loop cut through an n-gon, because there is no single correct solution. I would argue that in many cases, there is a solution that seems obvious to the user, and it would be great if Blender could try to find it. It would be an option, of course, perhaps by pressing N after starting the loop cut.
I don't know anything about graphics programming, but I imagine an algorithm that projects a line perpendicular the first edge, to locate the "opposite" edge on the face. Or maybe it's a matter of imagining edges from the center of the first edge to the centers of the others, and the imagined whose center is closest to the center of the n-gon (and lies inside the n-gon) is chosen.
I don't know. I'm sure the algorithm may be imperfect, and there may be many times when the user would have to cancel the tool because it's not doing what they imagine is "correct," but it seems possible to do something useful most of the time.
A clever algorithm could also work on tris, e.g. to add loop cuts to a cone.
2 Comments
Hi, did you know that if you select the edges you want traversed by the yellow loop and hit Edges/Subdivide you get exactly that? I agree it's not that elegant with dense models but I find this situation not that frequent.
I imagine press C to unclamp the attempts to find the next quad, look at the end points of the current edge loop and project a line invluenced by the path of that last edge to see if it hits another edge and if that edge happens to be part of a quad, continue as usual.