US 12,480,769 B2
Method for searching for shortest path having minimum link between buildings in rectilinear polygon obstacle environment
Hee Kap Ahn, Pohang-si (KR); Tae Kang Eom, Pohang-si (KR); Hwi Kim, Pohang-si (KR); and Min Cheol Kim, Pohang-si (KR)
Assigned to POSTECH ACADEMY-INDUSTRY FOUNDATION, Pohang-si (KR)
Filed by POSTECH ACADEMY-INDUSTRY FOUNDATION, Pohang-si (KR)
Filed on May 16, 2023, as Appl. No. 18/318,663.
Claims priority of provisional application 63/356,005, filed on Jun. 27, 2022.
Claims priority of application No. 10-2022-0071234 (KR), filed on Jun. 13, 2022.
Prior Publication US 2023/0400308 A1, Dec. 14, 2023
Int. Cl. G01C 21/34 (2006.01)
CPC G01C 21/3407 (2013.01) 7 Claims
OG exemplary drawing
 
1. A computer-implemented method of determining a shortest path having a minimum link between two buildings in a rectilinear polygon obstacle environment, the method comprising:
determining a segment-point minimum link and shortest path between a starting segment and a point using a first algorithm in a rectilinear quadrangle environment;
computing a segment-segment minimum link and shortest path between the starting segment and an arrival segment based on the first algorithm;
transforming the rectilinear quadrangle environment to a rectilinear polygon environment; and
generating a building-building minimum link and shortest path based on the computing of the segment-segment minimum link and shortest path,
wherein:
the segment-point minimum link and shortest path is formed by a sequence of connected vertical segments and horizontal segments, wherein the vertical and horizontal segments alternate in orientation between vertical and horizontal, and the segment-segment minimum link and shortest path extends from the starting segment to the point;
a binary tree data structure stores link count updates as a sweep line passes through vertical segments;
the rectilinear polygon environment is divided into areas based on characteristics of a shortest path between the starting segment and a given point in the rectilinear polygon environment;
the characteristics comprise at least two different types based on x-monotone, y-monotone, and xy-monotone characteristics;
the areas comprise at least two different types of monotone areas based on an x-monotone area, a y-monotone area, and an xy-monotone area; and
different points within the x-monotone area have the same x-monotone characteristics, different points within the y-monotone area have the same y-monotone characteristics, and different points within the xy-monotone area have the same xy-monotone characteristics.