TRANSFORMING POLYGONAL MESH BY SUB-POLYCHORD COLLAPSE
First Claim
1. A method, comprising:
- identifying, among a plurality of sub-polychords of a given size in a polychord mesh, a seed sub-polychord having an optimal value of a metric associated with collapsing the respective sub-polychord;
identifying, by a processing device, a first test value of the metric for a first test sub-polychord comprising the seed sub-polychord and a first adjacent edge;
identifying a second test value of the metric for a second test sub-polychord comprising the seed sub-polychord and a second adjacent edge; and
responsive to determining a minimum of the first test value of the metric and the second test value of the metrics is less than a base value of the metric for the seed sub-polychord, transforming the seed sub-polychord by adding an adjacent edge that produces a test sub-polychord having the minimum test value.
1 Assignment
0 Petitions
Accused Products
Abstract
An example method of transforming polygonal meshes by sub-polychord collapse may include identifying, among a plurality of sub-polychords of a given size, a seed sub-polychord having an optimal value of a metric associated with collapsing the respective sub-polychord. The example method may further include identifying a first test value of the metric for a first test sub-polychord comprising the seed sub-polychord and a first adjacent edge, and further identifying a second test value of the metric for a second test sub-polychord comprising the seed sub-polychord and a second adjacent edge. The example method may further include, responsive to determining a minimum of the first test value of the metric and the second test value of the metrics is less than a base value of the metric for the seed sub-polychord, transforming the seed sub-polychord by adding an adjacent edge that produces a test sub-polychord having the minimum test value.
9 Citations
20 Claims
-
1. A method, comprising:
-
identifying, among a plurality of sub-polychords of a given size in a polychord mesh, a seed sub-polychord having an optimal value of a metric associated with collapsing the respective sub-polychord; identifying, by a processing device, a first test value of the metric for a first test sub-polychord comprising the seed sub-polychord and a first adjacent edge; identifying a second test value of the metric for a second test sub-polychord comprising the seed sub-polychord and a second adjacent edge; and responsive to determining a minimum of the first test value of the metric and the second test value of the metrics is less than a base value of the metric for the seed sub-polychord, transforming the seed sub-polychord by adding an adjacent edge that produces a test sub-polychord having the minimum test value. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A method, comprising:
-
identifying, by a processing device, a plurality of sub-polychords in a polychord mesh comprising one or more polychords; identifying, among the plurality of sub-polychords, a candidate sub-polychord having an optimal value of a metric associated with collapsing the respective sub-polychord; and collapsing the candidate sub-polychord by replacing a set of edges comprised by the candidate sub-polychord with a set of vertices. - View Dependent Claims (7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19)
-
-
20. A computer-readable non-transitory storage medium comprising executable instructions to cause a processing device to:
-
identify, by the processing device, a plurality of sub-polychords in a polychord mesh comprising one or more polychords; identify, among the plurality of sub-polychords, a candidate sub-polychord having an optimal value of a metric associated with collapsing the respective sub-polychord; and collapse the candidate sub-polychord by replacing a set of edges comprised by the candidate sub-polychord with a set of vertices.
-
Specification