Method for searching for shortest path having minimum link between buildings in rectilinear polygon obstacle environment

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.

Dependencies are inferred from the claim text.