Fast wireframe-visibility algorithm

In this paper, a fast wireframe-visibility algorithm is introduced. The algorithm's inputs are 3D wireframe model of an object, internal and external camera calibration parameters. Afterwards, the algorithm outputs the 2D image of the object with only visible lines and surfaces. 2D image of an object is constructed by using a camera model with the given camera calibration parameters and 3D wireframe object model. The idea behind the algorithm is finding the intersection points of all lines in 2D image of the object. These intersection points are called as critical points and the lines having them are critical lines. Lines without any critical points are regarded as normal lines. Critical and normal lines are processed separately. Critical lines are separated into smaller lines by its critical points and depth calculation is performed for the middle points of these smaller lines. For the normal lines, depth of the middle point of the normal line is calculated to determine if it is visible or not. As a result, the algorithm provides the minimum amount of point's depth calculation. Moreover, this idea provides much faster process for the reason that there aren't any resolution and memory problems like well-known image-space scan-line and z-buffering algorithms.