Study and improvementation of hidden-line removal algorithm for convex polyhedrons

To form strong three-dimensional stereoscopic impression,the invisible lines must be eliminated due to the self-occlusion and mutual occlusion.The hidden-line elimination algorithm of the vanishing algorithm is studied for the three dimensional geometrical forms.According to the shortage of larger amount of calculation,long work time and lower efficiency based on the traditional hiding-line elimination algorithm for the convex polyhedrons,the improved algorithm is presented,assisting the met-hod of the bounding box's maximum and minimum test,and the depth priority sorting on the basis of the original algorithm,which could reduce the time complexity.The algorithm uses C++ to realize,and the time complexity from N2 to N is reduced.The experiment proves that the improved algorithm greatly enhances the efficiency.