Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9045
Full metadata record
DC FieldValueLanguage
dc.contributor.authorReddy, G. Sudhakar-
dc.date.accessioned2014-11-18T08:12:48Z-
dc.date.available2014-11-18T08:12:48Z-
dc.date.issued1986-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9045-
dc.guideGarg, K.-
dc.description.abstractComputer Graphics is now a mature discipline. Both hardware and software are available that facilitate the production of graphical images as diverse as line drawings and realistic renderings of natural objects. One of the most challenging problems in computer graphics is the removal of hidden parts from images of solid objects. In real life, the opaque material of these objects obstructs the light rays from hidden parts and prevents us from seeing them. But in the computer generation of an image no such automatic elimination takes place. Instead all parts of each object are displayed. In order to remove these parts and to create a more realistic image, we must apply a hidden line or hidden-surface algorithm to the set of objects. In this dissertation one such hidden line algorithm, which works at object resolution has been implemented. The program has been written implemented in Pascal language and run on DEC-2050 system of the Roorkee University Regional Computer Centre. The final image has been displayed on the Tektronix 4010 graphic terminal connected to the same system using simple MOVE and DRAW routines.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectHIDDEN LINE ALGORITHMen_US
dc.subjectOBJECT SPACEen_US
dc.subject3-D PLOTTINGen_US
dc.titleIMPLEMENTATION OF A HIDDEN LINE ALGORITHM IN OBJECT SPACE FOR 3-D PLOTTINGen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number178814en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD178814.pdf3.34 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.