Map Data Encoding Using Relative Vertex Positioning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for encoding and decoding map data are inefficient, leading to increased resource utilization and latency in generating, storing, and displaying graphical maps, particularly when dealing with complex geographical features like buildings with multiple outlines and void regions.
Innovation Solution
A method that encodes map data by determining the quantity and positions of vertices defining building outlines and void regions, using quantization scales and identifiers to reduce data size, and efficiently transmits and processes this data for faster rendering.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If traditional encoding methods are used for map data, then the data can represent building features, but the data size increases leading to higher resource utilization and latency
Solution Approach 1:
The patent segments the building representation into distinct components: exterior surfaces defined by vertices and edges, and interior void regions defined by separate vertices and edges. This segmentation allows for more efficient encoding by processing and storing only the necessary geometric information for each component separately, reducing overall data redundancy while maintaining complete building representation.
Solution Approach 2:
The patent extracts and encodes only the essential geometric information needed for building representation - specifically the vertices, edges, and their topological relationships. By taking out only these critical elements and excluding redundant information, the system achieves compact data representation that reduces storage requirements and processing latency.
2Manufacturing precision
If detailed building geometry is encoded with all vertices and edges, then visual fidelity is maintained, but processing time and resource expenditure increase
Solution Approach 1:
The patent applies local quality by encoding different levels of geometric detail for different building regions. Exterior surfaces use vertex and edge definitions that provide sufficient detail for accurate rendering, while interior void regions use a simplified representation approach. This localized differentiation maintains visual fidelity where needed while reducing processing overhead in less critical areas.
Solution Approach 2:
The patent performs preliminary encoding of building geometry data into an optimized format before it is needed for rendering. By pre-processing and structuring the vertex and edge information in advance, the system reduces real-time processing requirements and latency when the data is actually used for visual generation.
3Loss of information
If complete building information is stored including all vertices and edges, then data completeness is maintained, but storage resources and transmission bandwidth increase
Solution Approach 1:
The patent merges the encoding of exterior and interior building information into a unified data structure that shares common vertex and edge representations. By combining these representations and eliminating redundant information, the system maintains complete building information while significantly reducing the total storage capacity required compared to separate encoding approaches.
Solution Approach 2:
The patent creates a universal encoding scheme that handles both exterior surfaces and interior void regions using the same fundamental vertex and edge primitives. This multi-functional approach allows a single data structure to represent complete building information, eliminating the need for separate encoding formats and reducing overall data volume while maintaining information completeness.
Data Source
AI summary
An exemplary system receives first data representing one or more buildings, and generates second data representing the one or more buildings. Generating the second data includes, for each of the one or more buildings: (i) determining, based on the first data, a plurality of first edges defining an exterior surface of at least a portion of the building, where the first edges interconnect at a plurality of first points, (ii) encoding, in the second data, information corresponding to the quantity of the first points, (iii) encoding, in the second data, an absolute position of one of the first points, and (iv) for each of the remaining first points, encoding, in the second data, a position of that first point relative to a position of at least another one of the first points. The system outputs the second data.