The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Oct. 27, 2020

Filed:

Oct. 01, 2019
Applicant:

Factual Inc., Los Angeles, CA (US);

Inventors:

Ahad Rana, Los Angles, CA (US);

Boris Shimanovsky, Los Angles, CA (US);

Assignee:

FACTUAL INC., New York, NY (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 16/21 (2019.01); G06N 20/00 (2019.01); G06F 16/23 (2019.01); G06F 16/29 (2019.01); G06F 16/35 (2019.01); G06F 16/28 (2019.01); G06F 16/31 (2019.01); G06F 16/951 (2019.01); G06F 16/2458 (2019.01); G06F 16/2455 (2019.01); G06Q 10/10 (2012.01); G06Q 50/00 (2012.01); G05B 13/02 (2006.01); H04W 4/029 (2018.01); H04W 76/38 (2018.01); H04W 4/50 (2018.01); G06Q 30/02 (2012.01); H04L 12/24 (2006.01); H04W 4/02 (2018.01); H04W 4/021 (2018.01); H04W 8/08 (2009.01); H04W 8/16 (2009.01); H04W 8/18 (2009.01); H04W 16/24 (2009.01); H04W 64/00 (2009.01); H04W 88/02 (2009.01); G06N 5/02 (2006.01); G06F 16/335 (2019.01); H04W 16/00 (2009.01); H04W 16/30 (2009.01); H04W 16/32 (2009.01); H04W 88/00 (2009.01);
U.S. Cl.
CPC ...
G06F 16/21 (2019.01); G05B 13/0265 (2013.01); G06F 16/23 (2019.01); G06F 16/235 (2019.01); G06F 16/2379 (2019.01); G06F 16/2386 (2019.01); G06F 16/2477 (2019.01); G06F 16/24564 (2019.01); G06F 16/282 (2019.01); G06F 16/285 (2019.01); G06F 16/29 (2019.01); G06F 16/313 (2019.01); G06F 16/35 (2019.01); G06F 16/951 (2019.01); G06N 5/022 (2013.01); G06N 20/00 (2019.01); G06Q 10/101 (2013.01); G06Q 30/0261 (2013.01); G06Q 30/0282 (2013.01); G06Q 50/01 (2013.01); H04L 41/14 (2013.01); H04W 4/02 (2013.01); H04W 4/021 (2013.01); H04W 4/025 (2013.01); H04W 4/029 (2018.02); H04W 4/50 (2018.02); H04W 8/08 (2013.01); H04W 8/16 (2013.01); H04W 8/18 (2013.01); H04W 16/24 (2013.01); H04W 64/00 (2013.01); H04W 64/003 (2013.01); H04W 76/38 (2018.02); H04W 88/02 (2013.01); G06F 16/337 (2019.01); H04W 16/00 (2013.01); H04W 16/30 (2013.01); H04W 16/32 (2013.01); H04W 88/00 (2013.01);
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.


Find Patent Forward Citations

Loading…