Mesh Patch Overlap Checking for Efficient 3D Compression
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing mesh coding technologies face challenges in efficiently handling overlapping patches during mesh compression, leading to inefficiencies in data storage and transmission resources for immersive 3D models.
Innovation Solution
The proposed solution involves processing circuitry that determines and ensures non-overlapping regions for patches in a 2D map by using bounding boxes and checking for intersection-free boundaries, applying enlargement techniques if necessary, to maintain non-overlapping conditions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If mesh data is partitioned into patches for compression, then compression efficiency is improved, but ensuring overlapping-free patches increases computational complexity
Solution Approach 1:
The mesh is divided into multiple patches, each independently processed for compression. This segmentation allows parallel processing of overlapping-free checks across patches, improving compression efficiency while managing computational complexity through distributed verification
Solution Approach 2:
The overlapping-free property is verified before compression encoding occurs. By performing this check in advance, the system prevents invalid patch configurations from entering the compression pipeline, avoiding rework and ensuring efficient processing downstream
2Measurement precision
If bounding box enlargement is applied to verify non-overlapping, then accuracy of overlap detection is improved, but processing time increases
Solution Approach 1:
Enlargement is applied selectively only to bounding boxes of patches that require verification, rather than uniformly to all patches. This localized approach maintains high detection accuracy for critical cases while minimizing unnecessary processing time for already-verified patches
Solution Approach 2:
The enlargement verification is nested within the existing bounding box framework. The enlarged bounding box contains the original bounding box, creating a hierarchical verification structure that reuses computational results from the base level while adding only the necessary expansion check
Data Source
AI summary
Processing circuitry receive first UV coordinates associated with first vertices of a first patch and second UV coordinates associated with second vertices of a second patch. The first patch and the second patch are partitions from a three dimensional (3D) mesh, the 3D mesh represents a surface of an object with polygons and is partitioned into patches. The first patch includes the first vertices that are mapped to first two dimensional (2D) vertices of a first 2D patch in a 2D map according to the first UV coordinates, the second patch includes the second vertices that are mapped to second 2D vertices of a second 2D patch in the 2D map according to the second UV coordinates. The processing circuitry can apply various overlapping checking techniques on the first 2D patch and the second 2D patch.