Vertex split connectivity prediction for improved progressive mesh compression
First Claim
1. A computer-implemented method of progressive mesh compression, comprising:
- identifying, by an encoder, a pair of partitioning vertices to be connected to a split vertex associated with a collapse of an edge;
creating, by the encoder, the split vertex by collapsing the edge;
encoding, by the encoder, partitioning vertex information associated with the pair of partitioning vertices, the encoding of the partitioning vertex information based on an ordering of vertices of an umbrella of the split vertex, and the ordering of vertices of the umbrella determined based on a distance between the vertices of the umbrella and a perpendicular bisector of a diameter of the umbrella; and
generating, by the encoder, vertex split information that includes the partitioning vertex information.
2 Assignments
0 Petitions
Accused Products
Abstract
An encoder includes a processor and a memory. The encoder may perform a method of progressive compression. In one example implementation, the method may include identifying a pair of partitioning vertices to be connected to a split vertex associated with a collapse of an edge, creating the split vertex by collapsing the edge, encoding partitioning vertex information associated with the pair of partitioning vertices, the encoding of the partitioning vertex information based on an ordering of vertices of an umbrella of the split vertex, and the ordering of vertices of the umbrella determined based on a geometric shape and connectivity of the umbrella, and generating vertex split information that includes the partitioning vertex information. In another example implementation, the method may include entropy encoding the vertex split information prior to being transmitted.
-
Citations
18 Claims
-
1. A computer-implemented method of progressive mesh compression, comprising:
-
identifying, by an encoder, a pair of partitioning vertices to be connected to a split vertex associated with a collapse of an edge; creating, by the encoder, the split vertex by collapsing the edge; encoding, by the encoder, partitioning vertex information associated with the pair of partitioning vertices, the encoding of the partitioning vertex information based on an ordering of vertices of an umbrella of the split vertex, and the ordering of vertices of the umbrella determined based on a distance between the vertices of the umbrella and a perpendicular bisector of a diameter of the umbrella; and generating, by the encoder, vertex split information that includes the partitioning vertex information. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. An encoder, comprising:
-
a processor; and a memory, the memory including instructions configured to cause the processor to; identify a pair of partitioning vertices to be connected to a split vertex associated with a collapse of an edge; create the split vertex by collapsing the edge; encode partitioning vertex information associated with the pair of partitioning vertices, the encoding of the partitioning vertex information based on an ordering of vertices of an umbrella of the split vertex, and the ordering of vertices of the umbrella determined based on a distance between the vertices of the umbrella and a perpendicular bisector of a diameter of the umbrella; and generate vertex split information that includes the partitioning vertex information. - View Dependent Claims (9, 10, 11)
-
-
12. A non-transitory computer-readable storage medium having stored thereon computer executable program code which, when executed on a computer system, causes the computer system to perform a method of progressive mesh compression, comprising:
-
identifying, by an encoder, a pair of partitioning vertices to be connected to a split vertex associated with a collapse of an edge; creating, by the encoder, the split vertex by collapsing the edge; encoding, by the encoder, partitioning vertex information associated with the pair of partitioning vertices, the encoding of the partitioning vertex information based on an ordering of vertices of an umbrella of the split vertex, and the ordering of vertices of the umbrella determined based on a distance between the vertices of the umbrella and a perpendicular bisector of a diameter of the umbrella; and generating, by the encoder, vertex split information that includes the partitioning vertex information. - View Dependent Claims (13, 14, 15, 16, 17, 18)
-
Specification