PATENT CLAIM ANALYSIS

Application Number: 16006748
Application Type: Utility
Filing Date: 2018-06
Publication Date: 2018-10
Patent Classification: ["455", "456300"]

Abstract:
The disclosed apparatus, systems, and methods relate to a location query mechanism that can efficiently determine whether a target entity is located within a region of interest (ROI). At a high level, the location query mechanism can be configured to represent a ROI using one or more polygons. The location query mechanism can, in turn, divide (e.g., tessellate) the one or more polygons into sub-polygons. Subsequently, the location query mechanism can use the sub-polygons to build an index system that can efficiently determine whether a particular location is within any of the sub-polygons. Therefore, when a computing device queries whether a particular location is within the region of interest, the location query mechanism can use the index system to determine whether the particular location is within any of the sub-polygons.

Claim (Index 21):
An apparatus comprising:\n a memory device to store an index system that identifies sub-polygons in a region of interest; and a processor and non-volatile memory comprising a set of computer-readable instructions, wherein the processor is configured to execute the computer readable instructions to:\n determine a query identifier corresponding to a location identifier; \n compare one or more bits in the query identifier with bits in the index system to determine that the query identifier is represented in the index system, wherein the step of comparing includes:\n comparing a first set of bits of the one or more bits in the query identifier, corresponding to a lower-precision sub-polygon, to the bits in the index system, corresponding to the sub-polygons in the region of interest; \n comparing a second set of bits of the one or more bits in the query- identifier, corresponding to a higher-precision sub-polygon, to the bits in the index system, corresponding to the sub-polygons in the region of interest; and \n \n determine whether the location identifier corresponds to one or more of the sub-polygons within the region of interest, \n wherein the sub-polygons are generated within one or more polygons that are enclosed by the region of interest and the sub-polygons are identified in an iterative manner in the index system.

Metadata:
- Claim Count in Document: 35.0
- Percentile: 94.0
- Lexical Diversity: 2.3871
- Patent Class: 455.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15673349', '14214296', '15353447', '15799569', '14815022']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.6916885673913422
- 35 USC 102 Novelty (BERT): 0.5736859703198659
- Combined Prediction Score: 0.6798883076841946
- Mean Citation Score: 327.5632740000001
- Max Citation Score: 503.87933
- Similarity Product: 448.84720728535234

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

Dataset: test