US 12,260,502 B2
System and method for searching position of a geographical data point in three-dimensional space
Tushar Chhabra, New Delhi (IN); Saurav Agarwala, New Delhi (IN); and Alankrit Mathur, New Delhi (IN)
Assigned to CRON SYSTEMS PVT. LTD., New Delhi (IN)
Filed by CRON SYSTEMS PVT. LTD., New Delhi (IN)
Filed on Dec. 20, 2022, as Appl. No. 18/085,142.
Application 18/085,142 is a continuation of application No. PCT/IB2021/055974, filed on Jul. 2, 2021.
Claims priority of application No. 202011027506 (IN), filed on Jun. 29, 2020.
Prior Publication US 2023/0127546 A1, Apr. 27, 2023
Int. Cl. G06T 17/20 (2006.01); G06T 7/73 (2017.01)
CPC G06T 17/20 (2013.01) [G06T 7/75 (2017.01)] 9 Claims
OG exemplary drawing
 
1. A processor implemented method for mapping location of one or more target data points to a D-dimensional environment, the method comprising the step of:
obtaining a D-dimensional point-cloud data of the D-dimensional environment and one or more target data points from one or more sensing units, the D-dimensional point-cloud data containing location information of each data point of the D-dimensional environment;
obtaining a sorted array of a plurality of D-dimensional polygons, each D-dimensional polygon having a centroid, wherein the sorted array of the plurality of D-dimensional polygons represents the D-dimensional environment;
mapping the sorted array of the plurality of D-dimensional polygons to a D-dimensional cartesian coordinate system;
determining a floor value and a ceiling value of each coordinate point of each target data point; calculating one or more shifted floor value and one or more shifted ceiling value of each coordinate point of each target data point;
combining the one or more shifted floor value and the one or more shifted ceiling value for determining one or more potential centroids;
authenticating the one or more potential centroids for determining one or more real centroids by determining the presence of the one or more potential centroid in the array of centroids; calculating the distance of the target data point from the one or more real centroids; and
determining the polygon having the real centroid with the least distance from the target data point.