3D Polyhedron Two-Dimensional Code Encoder
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional two-dimensional codes face limitations in recording capacity and security, particularly when trying to store large volumes of information and maintain decoding precision, especially with the increased complexity of multicolor codes and the ease of reverse engineering of publicly disclosed encoding algorithms.
Innovation Solution
A device that affixes multiple two-dimensional codes onto the planes of a three-dimensional polyhedron, allowing for increased recording capacity by utilizing both front and rear surfaces for information storage, with authentication information secured on the rear surface to prevent easy decoding and using conventional scanners for reading.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If the recording capacity of information data cells is increased, then the density of information data cells is increased, but the finder marker recognition time is extended
Solution Approach 1:
The patent transitions from conventional two-dimensional codes to three-dimensional codes by utilizing depth information. Multiple information data cells are arranged at different depths (first depth and second depth), allowing increased recording capacity without increasing planar density, thus maintaining fast finder marker recognition.
2Quantity of substance
If multicolor cells are used to increase information density, then the recording capacity is improved, but the decoding precision is reduced due to color fading and printing irregularity
Solution Approach 1:
Instead of using multiple colors, the patent changes the parameter from color variation to depth variation. Information data cells use the same color (black) but are positioned at different depths (first depth for '0', second depth for '1'), eliminating color fading and printing irregularity issues while maintaining high information density.
3Device complexity
If conventional two-dimensional code algorithms are used, then the encoding and decoding process is simple, but the recording capacity is limited and security is compromised
Solution Approach 1:
The patent extends conventional two-dimensional code algorithms to three dimensions by adding depth as a new dimension. Information data cells are arranged at multiple depths, allowing the same simple black-and-white algorithm to achieve much higher recording capacity without increasing algorithmic complexity.
4Area of stationary object
If the surface area of the two-dimensional code is limited for display on screens, then the portability is improved, but the volume of information that can be stored is reduced
Solution Approach 1:
The patent utilizes the third dimension (depth) to overcome the surface area limitation. By arranging information data cells at different depths within the same planar footprint, the code can store much more information without increasing the display area on screens or the physical size of the code.
Data Source
AI summary
A two-dimensional code encoder for a two-dimensional code which is generated on a mobile phone terminal or a personal computer includes a device configured to generate multiple two-dimensional codes in advance and to store to preserve the two-dimensional codes so generated, a device configured to affix the multiple two-dimensional codes so preserved individually to 12 surfaces of front and rear surfaces of polygonal plates of a three-dimensional polyhedron (a regular hexahedron), a device configured to tag the two-dimensional codes affixed to the 12 surfaces for storage, and a device configured to display the tagged two-dimensional codes two-dimensionally on screens of the mobile phone terminal or the personal computer.