IP Library Granted Patent US 12,340,468
Granted Patent B2
US 12,340,468 · App. 16/819,118 · Granted Jun 24, 2025

Apparatus and method for displaced mesh compression

Inventors: Sven Woop (Voelklingen, DE); Karthik Vaidyanathan (San Francisco, CA); Carsten Benthin (Voelklingen, DE)
Assignee: Intel Corporation
G06T17/205G06T3/4007G06T9/00G06T15/005G06T15/06G06T15/08G06T17/10
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,340,468
App. No.
16/819,118
Granted
Jun 24, 2025
Kind
B2
Abstract

Apparatus and method for lossy displaced mesh compression. For example, one embodiment of an apparatus comprises: displacement mapping circuitry/logic to generate an original displacement-mapped mesh by performing a displacement mapping of a plurality of vertices of a base subdivision mesh; and mesh compression circuitry/logic to compress the original displacement-mapped mesh, the mesh compression circuitry/logic comprising a quantizer to quantize the displacement mapping of the plurality of vertices in view of a base mesh to generate a displacement array.

Claims (41)

1. An apparatus comprising:

displacement mapping circuitry/logic to generate an original displacement-mapped mesh by performing a displacement mapping of a plurality of vertices of a base subdivision mesh; and

mesh compression circuitry/logic to compress the original displacement-mapped mesh, the mesh compression circuitry/logic comprising a quantizer to quantize the original displacement-mapped mesh in view of a base mesh to generate a three-dimensional (3D) displacement array that includes a plurality of vectors each corresponding to a vertex of the plurality of vertices of the base subdivision mesh, wherein quantization of the original displacement-mapped mesh in view of the base mesh comprises generating, from the original displacement-mapped mesh, a compressed displaced mesh that includes the 3D displacement array and base coordinates of the base mesh, wherein a vector of the 3D displacement array indicates offsets to a vertex of the base subdivision mesh.

2. The apparatus of claim 1 wherein the mesh compression circuitry/logic is to further store the compressed displaced mesh.

3. The apparatus of claim 2 wherein the base mesh comprises the base subdivision mesh.

4. The apparatus of claim 2 further comprising:

an interpolator to perform bilinear interpolation on the base subdivision mesh to generate the base mesh.

5. The apparatus of claim 2 further comprising:

decompression circuitry/logic to decompress the compressed displaced mesh responsive to a request.

6. The apparatus of claim 5 wherein the decompression circuitry/logic attempts to reconstruct the original displacement-mapped mesh by combining the base coordinates of the base mesh with elements of the 3D displacement array to generate a decompressed displacement-mapped mesh.

7. The apparatus of claim 6 wherein the decompressed displacement-mapped mesh comprises an approximation of the original displacement-mapped mesh.

8. The apparatus of claim 7 further comprising:

bounding volume hierarchy (BVH) generation circuitry to generate a BVH based on a plurality of primitives including a first primitive associated with the decompressed displacement-mapped mesh.

9. The apparatus of claim 8 further comprising:

ray traversal/intersection circuitry to traverse one or more rays through the BVH to identify an intersection with the decompressed displacement-mapped mesh.

10. A method comprising:

generating an original displacement-mapped mesh by performing a displacement mapping of a plurality of vertices of a base subdivision mesh; and

compressing the original displacement-mapped mesh by quantizing the original displacement-mapped mesh in view of a base mesh to generate a three-dimensional (3D) displacement array that includes a plurality of vectors each corresponding to a vertex of the plurality of vertices of the base subdivision mesh, wherein quantization of the original displacement-mapped mesh in view of the base mesh comprises generating, from the original displacement-mapped mesh, a compressed displaced mesh that includes the 3D displacement array and base coordinates of the base mesh, wherein a vector of the 3D displacement array indicates offsets to a vertex of the base subdivision mesh.

11. The method of claim 10 wherein the method further comprises storing the compressed displaced mesh.

12. The method of claim 11 wherein the base mesh comprises the base subdivision mesh.

13. The method of claim 11 further comprising:

performing bilinear interpolation on the base subdivision mesh to generate the base mesh.

14. The method of claim 11 further comprising:

decompressing the compressed displaced mesh responsive to a request.

15. The method of claim 14 wherein the decompressing further comprises combining the base coordinates of the base mesh with elements of the 3D displacement array to generate a decompressed displacement-mapped mesh.

16. The method of claim 15 wherein the decompressed displacement-mapped mesh comprises an approximation of the original displacement-mapped mesh.

17. The method of claim 16 further comprising:

generating a bounding volume hierarchy (BVH) based on a plurality of primitives including a first primitive associated with the decompressed displacement-mapped mesh.

18. The method of claim 17 further comprising:

traversing one or more rays through the BVH to identify an intersection with the decompressed displacement-mapped mesh.

19. A non-transitory machine-readable medium having program code stored thereon which, when executed by a machine, causes the machine to perform:

generating an original displacement-mapped mesh by performing a displacement mapping of a plurality of vertices of a base subdivision mesh; and

compressing the original displacement-mapped mesh by quantizing the original displacement-mapped mesh in view of a base mesh to generate a three-dimensional (3D) displacement array that includes a plurality of vectors each corresponding to a vertex of the plurality of vertices of the base subdivision mesh, wherein quantization of the original displacement-mapped mesh in view of the base mesh comprises generating, from the original displacement-mapped mesh, a compressed displaced mesh that includes the 3D displacement array and base coordinates of the base mesh, wherein a vector of the 3D displacement array indicates offsets to a vertex of the base subdivision mesh.

20. The non-transitory machine-readable medium of claim 19 wherein the machine is caused to further perform storing the compressed displaced mesh.

21. The non-transitory machine-readable medium of claim 20 wherein the base mesh comprises the base subdivision mesh.

22. The non-transitory machine-readable medium of claim 20 further comprising program code to cause the machine to further perform bilinear interpolation on the base subdivision mesh to generate the base mesh.

23. The non-transitory machine-readable medium of claim 20 further comprising program code to cause the machine to further perform decompressing the compressed displaced mesh responsive to a request.

24. The non-transitory machine-readable medium of claim 23 wherein decompressing further comprises combining the base coordinates of the base mesh with elements of the 3D displacement array to generate a decompressed displacement-mapped mesh.

25. The non-transitory machine-readable medium of claim 24 wherein the decompressed displacement-mapped mesh comprises an approximation of the original displacement-mapped mesh.

26. The non-transitory machine-readable medium of claim 25 further comprising program code to cause the machine to perform generating a bounding volume hierarchy (BVH) based on a plurality of primitives including a first primitive associated with the decompressed displacement-mapped mesh.

27. The non-transitory machine-readable medium of claim 26 further comprising program code to cause the machine to perform traversing one or more rays through the BVH to identify an intersection with the decompressed displacement-mapped mesh.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 29, 2020
From: WOOP, SVEN; VAIDYANATHAN, KARTHIK; BENTHIN, CARSTEN
To: INTEL CORPORATION
Reel/Frame 053076/0186 →
Continuity (1)
Related Publication 20210287431A1 · Sep 16, 2021
References Cited (24)
US 20050168460A1 · Razdan et al. · 2005 [cited by applicant]
US 20140340403A1 · Droske · 2014 [cited by examiner]
US 20170243375A1 · Ceylan · 2017 [cited by examiner]
US 20200357128A1 · McCombe · 2020 [cited by examiner]
EP 1008108A1 · 2000 [cited by applicant]
JP 2009151754A · 2009 [cited by applicant]
JP 2010134919A · 2010 [cited by applicant]
JP 2013539125A · 2013 [cited by applicant]
WO 9827515A1 · 1998 [cited by applicant]
WO 2006062199A1 · 2006 [cited by applicant]
Ma et al., “Mobile 3D graphics compression for progressive transmission over Wireless network”, IEEE International Conference, 2009. (Year: 2009). [cited by examiner]
European Search Report and Search Opinion, EP App. No. 20209125.2, Apr. 26, 2021, 8 pages. [cited by applicant]
Ma et al., “Mobile 3D Graphics Compression for Progressive Transmission Over Wireless Network”, 11th IEEE International Conference on Computer-Aided Design and Computer Graphics, Aug. 19, 2009, pp. 357-362. [cited by applicant]
Office Action, EP App. No. 20209125.2, Feb. 24, 2023, 5 pages. [cited by applicant]
Laine, Samuli, “Restart Trail for Stackless BVH Traversal”, High Performance Graphics, The Eurographics Association 2010, 2010, 5 pages. [cited by applicant]
Office Action, ID App. No. P-00202010081, Dec. 13, 2023, 6 pages (4 pages of English Translation and 2 pages of Original Document). [cited by applicant]
Official Letter with Search Report, TW App. No. 109140177, Jun. 19, 2024, 39 pages (1 page of English Translation of Search Report and 38 pages of Original Document). [cited by applicant]
Office Action, AU App. No. 2020294195, Aug. 28, 2024, 3 pages. [cited by applicant]
Office Action, EP App. No. 20209125.2, Dec. 4, 2024, 5 pages. [cited by applicant]
Office Action, JP App. No. 2020-212137, Oct. 22, 2024, 5 pages (2 pages of English Translation and 3 pages of Original Document). [cited by applicant]
Office Action, MY App. No. PI2020006287, Sep. 20, 2024, 5 pages. [cited by applicant]
Notice of Allowance, TW App. No. 109140177, Oct. 7, 2024, 3 pages (1 page of English Translation and 2 pages of Original Document). [cited by applicant]
Notice of Acceptance, AU App. No. 2020294195, Mar. 21, 2025, 3 pages. [cited by applicant]
Notice of Allowance, JP App. No. 2020-212137, Apr. 15, 2025, 6 pages (3 pages of English Translation and 3 pages of Original Document). [cited by applicant]