An easier approach to visible edge determination from moving viewpoint

In this paper, we present an algorithm for visible edge determination from moving viewpoint in 2D-space by an easier approach. We show implementation details and performance analysis of the algorithm to justify the efficiency and correctness of the proposed algorithm. The time complexity of the algorithm is O(n²) in the worst case but we hope time complexity can be reduced practically because of the effective optimization in case of sorting angularly and finding intersection of points in a fixed range. Further modification of this algorithm is expected to determine the visible surface from moving perspective yielding the near optimal solution in 3D-space.