WALKING THROUGH GEOMETRY IN GIs

Is Computational Geometry a tool for GIs technology? The answer to this question is presented in this paper. We will present the efficient solutions for four intersection problems, that computational geometry can handle, in order to provide to GIs practice the state-of-the-art in the intersection of segments. More precisely, we are going to present. using a pseudo language description also, the results for the k nearest line segments below a query point p problem, the case of the intersections of n line segments with an infinite line and a vertical line segment. Finally. the solution for the intersection of n line segments with an arbitrary line segment will be described