EdgeMerge(signed_edge_id)

[strk]

While cleaning up the topology of a dataset for topologically correct simplification I found myself in need of dropping nodes of degree 2 from edge rings.

This ticket is to provide a mean to do that with a function.

[strk]

This is the kind of situation that I'm willing to cleanup:

[strk]

The implementation could be similar to that of GetEdgeRing, which is walking around a link and sewing until a node of degree != 2 is found. A signed edge id would give the direction to follow. Positive to walk forward, negative to walk backward.

[strk]

Now that I have this implemented, I wonder why if the code should really stop on first node of degree > 2 or if it should instead take a left turn and keep going… The latter would turn it into a whole-ring merging

[strk]

In order to maximize cleaning of a whole topology we'd want to always start with nodes of degree > 2 and then get to those of degree = 1, a primitive function could be one that stops at a node with degree != 1, then another function would iteratively call the primitive for each incident edge on each left-over node. Each iteration would drop nodes from the list of nodes to start from.

[robe]

Milestone renamed