多重な内包のある多角形群に与えられた点の内外判定とその応用

抄録

Whether a given point is located inside or outside of a polygon is understood naturally when the diagram is seen by ones own eyes. However, it is difficult to determine the same thing using a computer. This kind of problem has been treated as "the point location problem" in computational geometry or geographical data processing for several decades. In this study, we research advanced cases of this problem, such as the case that the point is given when the diagram consisted of several polygons which had multiple connotations, or the case that the point is given when there were several polygons inside one polygon. Also, as the example of an application, we intend to try to estimate the length of a route, including up-and-down distance, when two points are given on a map that has a road network and contour lines.