The research and improvement of hidden-line elimination algorithm for convex polyhedron

To form strong three-dimensional stereoscopic impression, the invisible lines must be eliminated due to the self occlusion and mutual occlusion. The article studied the hidden line elimination algorithm of the vanishing algorithm for the Three Dimensional geometrical forms. According to the shortage of larger amount of calculation and lower efficiency based on the traditional hiding-line elimination algorithm, the paper proposed the improved algorithm that endowed the algorithm a suitable data structure. It assisted the method of the bounding box´s maximum and minimum test and the depth priority sorting on the basis of the original algorithm, which could decrease the intersecting operations and reduce the complexity. The algorithm uses C++ to realize, and it can reduce the time complexity from N2 to N. The experiment proves that the improved algorithm greatly enhances the efficiency.