Abstract: Disclosed are embodiments of shortest path search in an obstacle environment. Provided is a shortest path search method including: creating an epsilon graph; and determining k closest points from a query point on the basis of the graph, wherein the creating of the graph includes: creating a node group of nodes on the basis of a point group of arrival points; creating an edge group of edges on the basis of the created nodes; setting, on the basis of an obstacle group of at least one obstacle, whether each of the nodes is a valid node or a non-valid node; setting, on the basis of the obstacle group, whether each of the edges is a valid or non-valid edge; and including, for each of the arrival points, a particular arrival point on an anchor list of a valid node closest from the particular arrival point among the valid nodes.

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.

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.

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.