Google patents method to compress 3D mesh data using local surface planes
This filing describes a way to shrink the file size of 3D models by guessing the position of points based on their neighbors. It uses the flatness of the local surface to calculate more accurate predictions, which reduces the amount of data needed to store each point.
In the filing’s own words
Methods and systems for compressing and decompressing vertex data in a mesh include identifying a target vertex to be compressed and a plurality of neighboring vertices. A first predicted position for the target vertex is determined based on the positions of the neighboring vertices, a normal vector for a plane defined by the neighboring vertices is determined, and a dominant coordinate among the three coordinates is identified based on the normal vector. Correction values for the other two coordinates are determined based on the first predicted position and actual coordinate values. A second predicted position for the dominant coordinate is calculated by plugging the actual values of the other two coordinates into the plane equation. A final correction value is determined, and the vertex is encoded using the three correction values. This prediction scheme leverages local planarity to improve accuracy and efficiency for irregularly sampled surfaces.
What exactly they claim (claim 1)
1. A method for compressing three-dimensional data comprising: identifying a first vertex as a vertex to be compressed, the first vertex having three coordinates with actual coordinate values; identifying a plurality of neighboring vertices; determining a first predicted position of the first vertex based on positions of the plurality of neighboring vertices, the first predicted position having predicted values for the three coordinates; determining a geometric constraint defined by the plurality of neighboring vertices; identifying a first coordinate of the three coordinates based on the geometric constraint; determining correction values for two coordinates of the three coordinates based on the predicted values of the first predicted position and the actual coordinate values of the first vertex, the two coordinates being different from the first coordinate; determining a correction value for the first coordinate of the three coordinates based on the actual coordinate values of the two coordinates and the geometric constraint; and compressing the first vertex using the correction values for the three coordinates.
Facts
- Company
- Google (GOOGLE LLC)
- Official title
- PREDICTION SCHEME FOR MESHES WITH IRREGULAR SURFACE SAMPLING
- Publication number
- US20260281433A1
- Application number
- 19563577
- Filed
- Mar 11, 2026
- Published
- Sep 17, 2026
- Inventors
- 2
- Claims
- 20
Classified under
H04N 19/597 Electricity & electronicsH04N 19/91 Electricity & electronicsMore from Google in AI & software
- Google patents video search that answers questions using AI descriptions Sep 15, 2026
- Google patents photo tool that removes people and their gear Sep 15, 2026
- Google patents AI that writes live meeting notes and summaries Sep 15, 2026
- Google patents AI tool that turns messy emergency notes into clear messages Sep 3, 2026
- Google patents AI that clicks through apps to finish tasks for you Sep 24, 2026
Summaries are simplified from the filing’s own abstract and first claim. A patent filing is not a product announcement.
Patent data and drawings: U.S. Patent and Trademark Office (USPTO). Nebula is not affiliated with or endorsed by the USPTO.