US 12,120,306 B2
V3C patch remeshing for dynamic mesh coding
Patrice Rondao Alface, Evere (BE); Aleksei Martemianov, Tampere (FI); Lukasz Kondrad, Munich (DE); Lauri Aleksi Ilola, Munich (DE); and Sebastian Schwarz, Unterhaching (DE)
Assigned to Nokia Technologies Oy, Espoo (FI)
Filed by Nokia Technologies Oy, Espoo (FI)
Filed on Mar. 3, 2023, as Appl. No. 18/116,937.
Claims priority of provisional application 63/321,176, filed on Mar. 18, 2022.
Prior Publication US 2023/0300336 A1, Sep. 21, 2023
Int. Cl. H04N 19/132 (2014.01); H04N 19/182 (2014.01); H04N 19/20 (2014.01)
CPC H04N 19/132 (2014.11) [H04N 19/182 (2014.11); H04N 19/20 (2014.11)] 30 Claims
OG exemplary drawing
 
1. An apparatus comprising:
at least one processor; and
at least one non-transitory memory storing instructions that, when executed by the at least one processor, cause the apparatus at least to:
obtain a three-dimensional model comprising at least one patch, at least one geometry component, at least one occupancy component, and zero or more texture components;
subsample the at least one geometry component of the at least one patch of a three-dimensional object at occupied positions using a subsampling criterion;
define respective search windows around the respective occupied positions;
select respective salient points relative to the respective occupied positions within the respective search windows;
triangulate the salient points to approximate a shape of the three-dimensional object;
detect zero or more triangles that overlap with at least one unoccupied pixel;
split the zero or more triangles that overlap with at least one unoccupied pixel until no triangle overlaps with the unoccupied pixels; and
add zero or more additional triangles close to a border of the three-dimensional object to generate a resulting mesh that is signaled to a decoder.