{
  "$type": "site.standard.document",
  "description": "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…",
  "path": "/patents/1356150",
  "publishedAt": "2023-12-14T00:00:00.000Z",
  "site": "at://did:plc:oql6ds5vnff4ugar6rruliwd/site.standard.publication/3mn3ohu7oxx5w",
  "tags": [
    "G01C21/3407",
    "POSTECH ACADEMY-INDUSTRY FOUNDATION"
  ],
  "textContent": "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.",
  "title": "METHOD FOR SEARCHING FOR SHORTEST PATH HAVING MINIMUM LINK BETWEEN BUILDINGS IN RECTILINEAR POLYGON OBSTACLE ENVIRONMENT"
}