An efficient algorithm to eliminate hidden lines using orthographic projection

Sushil Chandra Dimri; Umesh Kumar Tiwari; Kamlesh Chandra Purohit; Mangey Ram

Sushil Chandra Dimri Department of Computer Sceince and Engineering, \\Graphic Era Deemed to be University, Dehradun, Uttarakhand, India
Umesh Kumar Tiwari Department of Computer Sceince and Engineering, \\Graphic Era Deemed to be University, Dehradun, Uttarakhand, India
Kamlesh Chandra Purohit Department of Computer Sceince and Engineering, \\Graphic Era Deemed to be University, Dehradun, Uttarakhand, India
Mangey Ram Department of Computer Sceince and Engineering, \\Graphic Era Deemed to be University, Institute of Advanced Manufacturing Technologies,\\ Peter the Great St. Petersburg Polytechnic University, 195251 Saint Petersburg, Russia.Department of Mathematics,\\ Graphic Era Deemed to be University, Dehradun, Uttarakhand, India.; Dehradun, Uttarakhand, India.;

Abstract

Elimination of hidden lines is mandatory for realistic representation of real objects on computer screens. Many efficient algorithms proposed by eminent researchers are available to eliminate the hidden line. One of the most popular algorithms is depth algorithm which uses depth of each pixel on the surface and scans the entire buffer. This technique requires high memory to store the information of each pixel. In this work we propose an efficient algorithm to eliminate hidden lines using orthographic projections. The proposed algorithm obtains the orthographic projection of line and surface on the view plane. Both surface and line, we can uniquely identify them with the help of extreme vertex points. Then by using concept of line clipping, we compute the point of intersection of the line with boundaries of the obscuring surface and then clipping between point of intersection gives elimination of the hidden portion of the line.