Program and apparatus for searching for the furthest point to the exit in building space

摘要

PROBLEM TO BE SOLVED: To rapidly search for the farthest point to an exit of a building space with a simple configuration.SOLUTION: On the basis of the plan view of a building space to search, squares of a predetermined unit size are arranged in an orthogonal grid shape on a two-dimentional surface of the building space. For this purpose, one square is arranged as an origin at each of exits D1 and D2 of the building space (for example, the squares for different exits are filled in different colors). One or more orthogonally adjacent squares are arranged gradually and sequentially from the square of each exit as the origin (for example, the squares for different exits are filled in different colors). The two-dimentional position in the building space corresponding to the final blank of a one-square size or smaller on the two-dimentional surface is specified as the farthest point to the exit.SELECTED DRAWING: Figure 4