PATENT CLAIM ANALYSIS

Application Number: 16167422
Application Type: Utility
Filing Date: 2018-10
Publication Date: 2019-08
Patent Classification: ["707", "737000"]

Abstract:
Methods and systems for converting a point cloud dataset into a hierarchical data structure for a lossless representation of an input file are provided herein. In various embodiments the method comprises recursing subtrees using a preordered traversal for a plurality of nodes, the preordered traversal being checking a parent node and then checking children nodes and stopping the recursing of the subtrees using the preordered traversal of the plurality of nodes when a node of the plurality of nodes is a below threshold node. The below threshold node being less than a configuration specified maximum number of data points, the below threshold node being a leaf of a tileset. Further comprising, aggregating the leaf of the tileset into a lossless representation of the collection of input files.

Claim (Index 1):
A method for converting a point cloud dataset into a hierarchical data structure for a lossless representation of an input file, the method comprising:\n reading header information of a collection of input files, the reading of the header information determining an axis-aligned bounding box of the collection of input files and a total number of data points in the point cloud dataset, the axis -aligned bounding box representing the amount of space taken by the point cloud dataset; determining a cache level of the total number of data points in the point cloud dataset to generate a plurality of caches, based on the total number of data points and the axis-aligned bounding box of the point cloud dataset, the cache level being a level of program memory to fit all of the total number of data points in the point cloud dataset; subdividing each of the plurality of caches into subtrees based on the determining of the cache level of the total number of data points in the point cloud dataset, the subtrees having a plurality of nodes; and generating a tileset based on sorting of the plurality of nodes in the subtrees, the generating of the tileset resulting in the hierarchical data structure comprising a root tile and a plurality of children.

Metadata:
- Claim Count in Document: 7.0
- Percentile: 97.0
- Lexical Diversity: 2.12698
- Patent Class: 707.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['13156213', '12515235', '09872810', '12697342', '15658566']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.1872709029019879
- 35 USC 102 Novelty (BERT): 0.4852357656737835
- Combined Prediction Score: 0.2170673891791674
- Mean Citation Score: 157.928378
- Max Citation Score: 178.46152
- Similarity Product: 115.87072127448084

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

Dataset: test