Smart edge loop selection

A method of edge loop selection in computer graphics performed by a computer system, the method comprising:

• accessing a polygon mesh comprising a plurality of vertices and a plurality of edges associated with the plurality of vertices;
• receiving, via an input device of the computer system, a selection of a first edge connected to a first non-four-way intersection vertex;
• receiving, via the input device and after receiving the selection of the first edge, a selection of a second edge connected to the first non-four-way intersection vertex;
• and
• in response to receiving, via the input device, a command invoking an edge loop selection process:
• determining a number of edge(s) that is skipped from the first edge to the second edge on a left side or on a right side;
• determining a rule for selecting a next edge at a non-four-way intersection vertex based on the number of edge(s) that is skipped from the first edge to the second edge on a left side or on a right side;
• and
• completing an edge loop by, from the second edge and continuing in a direction from the first edge to the second edge:
• at each respective four-way intersection vertex, selecting a middle edge as the next edge at the respective four-way intersection vertex;
• and
• at each respective non-four-way intersection vertex, selecting the next edge based on the rule;
• wherein the rule comprises:
• upon determining that the first non-four-way intersection vertex has N number of edges connected thereto, N being an even integer equal to or greater than eight, and the number of edge(s) that is skipped from the first edge to the second edge is equal to M, M being between 2 and
• N
• 2
• -
• 2
• ,
• inclusive, processing all future non-four-way intersection vertices that have N number of edges connected thereto by skipping M number of edges on the left side or on the right side.

A method of edge loop selection in computer graphics performed by a computer system, the method comprising:

• accessing a polygon mesh comprising a plurality of vertices and a plurality of edges associated with the plurality of vertices;
• receiving, via an input device of the computer system, a selection of a first edge connected to a first non-four-way intersection vertex;
• receiving, via the input device and after receiving the selection of the first edge, a selection of a second edge connected to the first non-four-way intersection vertex;
• and
• in response to receiving, via the input device, a command invoking an edge loop selection process:
• determining a number of edge(s) that is skipped from the first edge to the second edge on a left side or on a right side;
• determining a rule for selecting a next edge at a non-four-way intersection vertex based on the number of edge(s) that is skipped from the first edge to the second edge on a left side or on a right side;
• and
• completing an edge loop by, from the second edge and continuing in a direction from the first edge to the second edge:
• at each respective four-way intersection vertex, selecting a middle edge as the next edge at the respective four-way intersection vertex;
• and
• at each respective non-four-way intersection vertex, selecting the next edge based on the rule;
• wherein the rule comprises:
• upon determining that the first non-four-way intersection vertex has N number of edges connected thereto, N being an odd integer that is equal to or greater than seven, and the number of edge(s) that is skipped from the first edge to the second edge is equal to M, M being between 2 and
• N
• 2
• -
• 1
• ,
• inclusive, processing all non-four-way intersection vertices that have N number of edges connected thereto by skipping M number of edges on the left side or on the right side.