公开(公告)号：US20240292182A1

公开(公告)日：2024-08-29

申请号：US18654345

申请日：2024-05-03

Applicant: Geotab Inc.

Inventor： Michael Scott

IPC: H04W4/021 ,  G08G1/00 ,  H04W4/029

CPC classification number: H04W4/021 ,  G08G1/207 ,  H04W4/029

Abstract: Systems and methods for processing geographical zones are provided. The method involves operating at least one processor to: define a bounding box surrounding a geographical zone; iteratively partition the bounding box into a plurality of bounding boxes by, starting with the bounding box in the first iteration: determine whether the bounding box contains more than a predetermined maximum number of vertices; divide the bounding box into two additional bounding boxes if the bounding box contains more than the predetermined maximum number of vertices, repeat the steps of determining and dividing the bounding box for the additional bounding boxes in the next iteration until each additional bounding box does not contain more than the predetermined maximum number of vertices; generate a binary tree data structure representing the geographical zone; search the binary tree data structure to determine whether a vehicle is located within one of the bounding boxes.

公开(公告)号：US12075307B1

公开(公告)日：2024-08-27

申请号：US18390129

申请日：2023-12-20

Applicant: Geotab Inc.

Inventor： Michael Scott

IPC: H04W4/021 ,  G08G1/00 ,  H04W4/029

CPC classification number: H04W4/021 ,  G08G1/207 ,  H04W4/029

Abstract: Systems and methods for processing geographical zones are provided. The method involves operating at least one processor to: define a bounding box surrounding a geographical zone; iteratively partition the bounding box into a plurality of bounding boxes by, starting with the bounding box in the first iteration: determine whether the bounding box contains more than a predetermined maximum number of vertices; divide the bounding box into two additional bounding boxes if the bounding box contains more than the predetermined maximum number of vertices, repeat the steps of determining and dividing the bounding box for the additional bounding boxes in the next iteration until each additional bounding box does not contain more than the predetermined maximum number of vertices; generate a binary tree data structure representing the geographical zone; search the binary tree data structure to determine whether a vehicle is located within one of the bounding boxes.

公开(公告)号：US12238610B2

公开(公告)日：2025-02-25

申请号：US18654345

申请日：2024-05-03

Applicant: Geotab Inc.

Inventor： Michael Scott

IPC: H04W4/21 ,  G08G1/00 ,  H04W4/021 ,  H04W4/029

Abstract: Systems and methods for processing geographical zones are provided. The method involves operating at least one processor to: define a bounding box surrounding a geographical zone; iteratively partition the bounding box into a plurality of bounding boxes by, starting with the bounding box in the first iteration: determine whether the bounding box contains more than a predetermined maximum number of vertices; divide the bounding box into two additional bounding boxes if the bounding box contains more than the predetermined maximum number of vertices, repeat the steps of determining and dividing the bounding box for the additional bounding boxes in the next iteration until each additional bounding box does not contain more than the predetermined maximum number of vertices; generate a binary tree data structure representing the geographical zone; search the binary tree data structure to determine whether a vehicle is located within one of the bounding boxes.

公开(公告)号：US12004041B1

公开(公告)日：2024-06-04

申请号：US18390129

申请日：2023-12-20

Applicant: Geotab Inc.

Inventor： Michael Scott

IPC: H04W4/021 ,  G08G1/00 ,  H04W4/029

CPC classification number: H04W4/021 ,  G08G1/207 ,  H04W4/029

Abstract: Systems and methods for processing geographical zones are provided. The method involves operating at least one processor to: define a bounding box surrounding a geographical zone; iteratively partition the bounding box into a plurality of bounding boxes by, starting with the bounding box in the first iteration: determine whether the bounding box contains more than a predetermined maximum number of vertices; divide the bounding box into two additional bounding boxes if the bounding box contains more than the predetermined maximum number of vertices, repeat the steps of determining and dividing the bounding box for the additional bounding boxes in the next iteration until each additional bounding box does not contain more than the predetermined maximum number of vertices; generate a binary tree data structure representing the geographical zone; search the binary tree data structure to determine whether a vehicle is located within one of the bounding boxes.