PATENT CLAIM ANALYSIS

Application Number: 15940789
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2019-05
Patent Classification: ["345", "419000"]

Abstract:
The current document is directed to a dimensional shuffle transform (“DST”) that maps a 3D space to a one-dimensional space that preserves 3D neighborhoods within ID neighborhoods within a recursive hierarchical structure. The search for points in a 3D subspace is reduced, by the DST, to one or more searches in the transformed ID space. The search is performed by either recursive decomposition of the 3D space indexed by the transform into subspaces, exploiting the transformed space structure, or by direct indexing into the region of interest. The searches over the subspaces generated by recursive decomposition are independent from one another, providing many opportunities for a variety of parallel, DST-enabled search methods. The DST provides a basis for fast and efficient compression of point clouds while avoiding construction and traversal of tree-like data structures.

Claim (Index 1):
A system that transforms a first data set, stored in a physical data-storage device or data-storage appliance, that includes digital representations of three-dimensional points into a corresponding second data set, stored in the same or in a different physical data-storage device or data-storage appliance, that includes digital representations of corresponding one-dimensional points, the system comprising:\n one or more processors; one or more memories; one or more data-storage devices; and computer instructions, stored in one or more of the one or more memories and one or more data-storage devices, that, when executed by one or more of the one or more processors, control the system to\n retrieve a digital representation of each three-dimensional point from the first data set, \n generate a corresponding digital representation of a one-dimensional point for each three-dimensional point by\n for each three-dimensional point,\n for each digital representation of each 3D-coordinate value of the three-dimensional point, \n \u2003for each bit in the digital representation of the 3D-coordinate value, \n \u2003\u2003set a corresponding bit in a digital representation of the corresponding one-dimensional point to the value of the bit in the digital representation of the 3D-coordinate value, and \n \n \n store the digital representations of the one-dimensional dimensional points in the second data set, and \n wherein the bits in a digital representation of a one-dimensional point corresponding to the bits in a digital representation of a 3D-coordinate value in a digital representation of a corresponding three-dimensional point are not adjacent to one another in the digital representation of the one-dimensional point.

Metadata:
- Claim Count in Document: 7.0
- Percentile: 90.0
- Lexical Diversity: 1.81707
- Patent Class: 345.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['13577895', '14822560', '10178548', '10152444', '10460707']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.617434018395052
- 35 USC 102 Novelty (BERT): 0.4728972390431638
- Combined Prediction Score: 0.6029803404598632
- Mean Citation Score: 144.48128200000005
- Max Citation Score: 145.99915
- Similarity Product: 102.0777548217058

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 0
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test