公开(公告)号：US20230195803A1

公开(公告)日：2023-06-22

申请号：US18084536

申请日：2022-12-19

Applicant: POSTECH ACADEMY-INDUSTRY FOUNDATION

Inventor： Hee Kap AHN ,  Jae Hoon CHUNG ,  Hwi KIM ,  Tae Kang EOM ,  Seung Jun LEE

IPC: G06F16/909 ,  G06F16/903

CPC classification number: G06F16/909 ,  G06F16/90335

Abstract: The present disclosure relates to a GIS geographical information retrieval method using a dynamic k-nearest neighbor search algorithm in an obstacle environment, which has been devised to search for geographical information by using a dynamic k-nearest neighbor search algorithm in an obstacle environment. The GIS geographical information retrieval method using a dynamic k-nearest neighbor search algorithm in an obstacle environment has an effect in that it can optimize a search time by considering obstacles as a range of angles, not discrete objects, on the basis of a query point, using the shortest path characteristics at the same time, and assigning priority to neighbors based on the calculated range of angles.

公开(公告)号：US20250069020A1

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

申请号：US18496700

申请日：2023-10-27

Applicant: POSTECH ACADEMY-INDUSTRY FOUNDATION

Inventor： Hee Kap AHN ,  Tae Kang EOM ,  Jong Min CHOI ,  Jae Gun LEE

IPC: G06Q10/067

Abstract: The present invention relates to an efficient optimal facility location determination method for convex demand position demand points implemented to arrange a plurality of facilities as close as possible to given demand locations when positions of the demand locations satisfy a convex position condition. According to the efficient optimal facility location determination method for convex position demand points of the present invention, when demand locations satisfy a convex position condition, it is possible to quickly calculate a method of efficiently arranging a plurality of facilities in a very short time. In addition, according to the present invention, even if positions of demand locations do not satisfy a convex position condition, it is possible to approximate arrangement of facilities, and to be applied to various fields such as a location selection of a warehouse or data clustering.

公开(公告)号：US20230400308A1

公开(公告)日：2023-12-14

申请号：US18318663

申请日：2023-05-16

Applicant: POSTECH ACADEMY-INDUSTRY FOUNDATION

Inventor： Hee Kap AHN ,  Tae Kang EOM ,  Hwi KIM ,  Min Cheol KIM

IPC: G01C21/34

CPC classification number: G01C21/3407

Abstract: The present disclosure relates to a method for searching for the shortest path having a minimum link between buildings in a rectilinear polygon obstacle environment, which has been implemented to calculate the shortest path having a minimum link, among the shortest paths based on a Manhattan distance from one building to another building, when buildings are given in a rectilinear polygon obstacle environment. According to the present disclosure, in searching for the shortest path having a minimum link between two buildings, a more efficient data structure can be used in terms of an execution time and memory. A building-building minimum link and shortest path search problem can be solved through only the addition of very small operations by using the segment-point minimum link and shortest path search algorithm which can be easily expanded to the building-building minimum link and shortest path search problem.