what is computer graphic explain its Sprllctioncenpute: grahicn inales ‘amputers Rover a wide ange ef tedunguet and technologies used In ceatng images (tanmest Computer graphs are extensively used in moves, teleisn shows ane Besgr Graphic designers ute computer Ted ther visual ements for Branding and arkting purposes Simulators for plots of medial Senlations for nonments and vsuolaatons to aid is Sndestanaing complxconcepts Stience and engineering Computer graphic ae Sha phenomena in fldssich a atone, hyies ana baogy savantage sraphie ‘ample data and concepts in» dew and Snderandable manner Intncivgy Computer graphics canbe ceiplor wsualrepresentatons in reakine Reals With vances technology computer Sndea wore Eticeny Cesting anaedng graphic igtally esgns an be auc erated pon, ious, which i important for branding sod valent Decesnity Digtal gaphicr canbe ely platforms main them wily accesible Comitectnenes| nd characteristic of computer CcATHOD ray tube xf ‘Rts were once the mest common Wype of Aspley technology ised in televsons and Seven eating the mages we see Stecon gu slated athe beck fhe CHT, Detection system The eecvon bear 5 then Prosphor Coating the rot surface of the CRT ‘ote wth phosphor Phosphotsaresubstances shns ands costed witha conducive mater to Felp dstribute the electrons evenly arss the thephosphor eoxtng eases he poosphorsto frit Eg resting» tiny at of hgh ele 3 aor Cti: Incolor CRTs the phosphor outings vided into groups ef ve cot eget, ad bce ae Ceontivowly eleshed maliple tines per Second peal SOF or Mighe 0 mara 4 Revlon The rscution of CRT dpa i determined by te numberof phosphor dts on the screen Higher Tesoltons have mere des, BT peaseeces ae ian (a Teaco a eae ‘Bacnenez nah ers pan Tene ipa oa ae aarp am + we oe pc ey ae este oe eh eh. ‘Fantitnsataans an eee es se oot ‘Septnoteatem a el rd By ‘ate |e crateonc ‘Feria te ne wre. lane. Explain the working details of DDA tine endpoints (2,2) and. (10,5) "using Bresenham's line drawing algertim-A the DBA Wigta iterentl Analyzer gt 8 Valles ofxanay teach sep ong teline Heres how work Step2: Declare yi x2y2aiyxy a integer vorables, Sep terval y232 S96 ABS b> ABS (6) Thenstep abr (ae Ee Steprinecaktep yne=ylsten signx=at asiny Step Set palo Seotixeneine yay ye Setpnets Roun Rous) step10 Repeat step 9a x2 Step Ens grt bresenham tine drawing algorithm. Algertnn that determines te pons ot an Ieamensenal aster that ou be selected Sept star algo Sepa Decne varble 1 x21 2 :2uy “and x22 are coordinates of Ending point Steps Gael 21 CateauteiiarayCaeute a= “aka oto Steps: Conser fe 9135 starting pont and Toned theses end-atifda> Slept Generate pont at eoornates Sepy- Check ohoe Ine generated Fao xend Stop deo mend=dee Ipcrementy=y +1 Sepi0:Draw a point aes cooranates SepIt-Gotestep7 Stepl2 End of Agortom bell Tana (65) rind intermediate point Sebston sien viel ys pada BalenMiPoint Circle Algor ‘Gcumlernce of the cide wang Srmety properties to minimize calclatons. Heres the Bead the centr by andrads Setxndyer wae <=: Detplinacy et putpaelex ae) pupuelirse—y ry potprelocr xc 90 Dutpuelp even) putpaeley rae ere) pupaely eae yd popaeley vee 90 teen) Cina Explain 30 basic geometic wanstormation ‘whan example postion, eienaion, and size of objects in ® ‘reecdsmersionl sce The base geometre tach uantornation wth an exaple ‘andaton another by seeing 2 constant fet to KS coordnater Theretaton mata or tathg an obec around ‘evans by an angle yondzoes ‘he sealing matric sen an abc by ators Shearing The shearing mat for searing an object along exansby ater Ste 20 transtorton 20 wnsfomatens ate operations that mol ‘he pentane, or anetation af 20 shaper ‘ipanaton ofeach th n example another by seang + constant elle! to 1S coordnatet, Suthertand Hedgman aigorih fr polygon clipping Pligon cipping is 3 process used in computer fnsure hat oly he pats ofthe pln Dat ate Inside te etppng region ae spayed, wl the ‘he Suthetand'Hodgan agri singe and een algorithm used or pabgen dipping ins ecangulrclopag vendo hereby {Cand ouputing «ne poigon tech edge The ain polygon then ute the npc or Input input the polygon to be cpp anne recanguit coping werden, Inazaon naz an empty Ito store the {ip Aguinst Le cage: Rete rough each vertex the put plyon For ea vets, check ts Ina te ke eage ofthe cpping window forthe ight ee ofthe eipping window {pagans Top Edge. Repeat he above process forthe ton edge ofthe dipping window process for the Boliom edge of the clipping Window Dra Dra the dpped polygon ung the clpped cohen Sutherland tne eliping The CoherSutheland ine cpg algo is Ure ep ne segments age rectangular “iping window wor by sing ech decerminng. if and where the line segment Interest he choping window Here how the upon works Endpoint Encoding: Encode each endpoint fhe Tne segment sing 2 bit code based ens Be Tepregion 2 Botom raion Hfabtis the points ouside the conesponding Cohen Sthertnd Alger: Star by computing the region codes or both Cheer nth enpeins ae inside the coping wingew Gegion code = 0000 they ae The ‘window ad thes tion coues have geal ND rest that net 0000, then the ne fegrentis entirely outside he eping venom Whe endponts are not both isde or both bts by cpping the te segment gaine each flipping boundary i tun op bottom, rahe Tet) reach clpping update thereon code Tne segments complete ide or outse he {lpping window. Final dn the potn fhe ine segman that What willbe the position of viewport to To maintain the same relative placement of jects ise a vewport asa window you thatthe objects apearinthesame postions and Ses rin the Wewpor 35 they de within the stecf:he wenper. Determine the sca airs fr both he ans and yan based onthe ze of the window and beste sealing factor the yas ‘Glelate sx 25th at ofthe vienportwitho ‘Gla he viewport poston Determine the poston ofthe viewport relate poston an ¥y be the yobrsnate ef the Calle ie Uy based on aw much the \aewport fet om the vandow rg, Poston the weer (iv relative tothe window orn Esse thatthe vewporis saleby sxand S50 the inden surlace detection, The seatne algorithm is & method wsed fer Vile race detection in computer rah {ile sca nes ne procesing euch sean nea fetermine te wl sues a Pat hoot Fagen Reeser: Representa poigons Inthe sane as aset of vertices and edges, age Table (ey rece an edge able at stores ‘in The minimum ycooranate ofthe age X The xecootcnate ofthe edge athe rimum (aut ‘ete Fdge Table AE} nalze an acve edge Processing Scan Une: Far exc) san ne from rather the coent scan ie tothe active edge ble Fite pistes between pls of edges nthe active cige ale wih the Clr ofthe caresponding maeratches te cuentscan ine Kanding Interectone. When 0. edges Wehiehstotherghtatthelntersecson pot Use the edge to the et Yor fling und the ne ufo keep tac ofthe depth of exh a Update the aber whe ling peso ensue Eetacesinthescen be file and the den sacs willbe ecuded by she vse suracesnecessary components The areca fal Realy (VR system an vary eepencng on te complecty and urpre ofthe experience However 3 peal Hexetountea Oepay AMD) ual and actor stmt reed forthe VR Icons to deplye one foreach el tat ‘he HMD may abo include headphones exphones fr spatal aud, “racing ster and elertalon of the uses head and Sometimes other ody pas or objects (6 and conven eaime secdetoneters gtescopes, and sometines ‘irra carat ovine sensors fr move Vir systems often che specalaed input These input. dees may include butos, Computing Hardware: 1 power computer oF gaming console i The computing hare Is responsible for rowing the VR appcsion, eking ur Sofware User netace 0 The Ul of 4 VR yer includes the meres ses to navigate ane interact wih the VE Explain the sean tine surface detection A The can lth 2 popular method for ‘faces are vena 30 sone when rendered fon 3.20 ply, Heres haw the sanding based on ther minmun coordinate Procering Sean ines For each ran he From [dd cages From the edge tale 1) whose rininiom ycooriate sequal tthe Curent Sorthe Ab thes-cordnate a the age Edge Table (The eage ble cons infermationaboct each edge ofthe pejgons, $ceordnate, andthe inverse slope othe edge DetveFoge Tle (eT) Te active eae abe Ts sores by the coordinate ofthe edges to etemine he onder ach pls a flee When two edges ites, the algoritm {etemines whch edge state and wnien Rest ter processing allscan nes the vile VR. vital Rea (VR) has several advantages depending onthe specie VE stem Hees 4 ‘gereraloveten Inmerive Fipeiece! VR. provides 3 Nighy Enhanced eating a Tiining VR canbe ured aloe coeepl end enitonents ia mete engeong way tntertamen, such a8 Inretsve games ad Simulations varios feds, such as heat, tion anengineerng, ‘Therapeutic Uses Vis beng wed in therapy or treating phobias 139, a6 other mevtal heath ‘onatons Disadranages of Cost Heath concerns: Prlonged ws of ican Les ate immersed ia virtual world and may lore toven th the real resluton eld of ven, and motion Becang Componens of eas: Wourted Display (HMO): The HD sworn fn the eae and typi canes of py Tracking Sytem The wacing system tacks he Input Devces VR stems ndude nput dees Sch 5 cones or loves or ineracing wth ser incerace:The utr inate of aR system Incuder remus settings, ane. contol fr ‘ypeatwr ital Realty (VR) an be categorie’ ito Several yes based onthe kel ef immersion, Nommmerve VR Ak krona desitop Ror $SDenwronments ths type af provides abasic Uses itract wth the tule ing heyboardand moure Semimmesive VR THs type of VR uses more immerve tecnnelogy sich 25 lige sce, Projecton systems or Resdimosnied dplye ita wth Initee tacking. capabii I provides a more imersne experince than orcmetsve WR bt nota eerie 3 uly Fully mesve Fully immersive proidesa high level of immersion, usally” svough Reveneuned "apy MoH th Senses Uses el fl immersea nthe vet tteranment fen th te ty f9 move and Transformation in compstr graphic fer to otientation of an object in & 2D or 30 space Transformations ave uted to exe various Sealing ‘them or appbing other types of Gonione, There are sever) per of transformations commenly used io computer Translation Tanshaten moves anebjecttion one poston to another along they, ana 225 Ih Tenyardzas sbject around 4 spetfe point ora 1920, rotavon spol around «point whe 30, Scaling: Sing changes he Seon bjet I an increase of decrease the ze along the, The objects Shape ‘ees slanted eect. ‘petted ais, such a8 the ahs, a oF # into 20 coordinates for display on 2 screen, Common tps f projection nce perspective Fi Interface 1A ash interface” pial refers to user Inveraces (UL) ected wing Aas Mash 2 rmutomesia stare lator tat vas populr Fomever Adobe ofcly ended support for Flas atte en of 2020 and most wea rowses Fch Muftmedia Suppor Fash alowed forthe forcreatng nteracve and engusing center. CCossPlattrm Compatiy ash conten acess platforms Vector Grapher Secu Vulrerabites: Flash as Kno fr ts curly wineries lexdng. to frequen Updater ana ptehe fader ect er resouceintesive. leading to peormance Irae on older ore power dees, ‘ecesai Flash ented ws not aboys Shays support sceen teadels and other cess 0k Fla Pane ‘Fisch pant” spiel refers to 8 panel or Flat panels could be used for vary of Flash plato ash panels could be eesigned na citomized to fut the needs of theips sete ae Menebats ongoneial LR agi ae neo Rs cent a mleptamet eran nt ich end, 2. Ripa ang erent eS ce ‘ces et ean eaten eRe s0 «Can rn arp an ees aite Soe deed eet este Sse det te ee cet ose arse t,he epee he ‘CMY and CMYK Model Ince clr made sch a8 RGD, whe ae ‘mean ea ary coord igs, we se Ssence ome Inte OMY modo tse egos: wes erat cl puro oer bara wie Bac ons tome ‘omnnon tors mer Cy fi) fe R} fi] fe MJe]1]-|6 G| = |) ~ [MI yl] {a} fe 8) ht) Ly ‘cree ‘cena ext Pe cee at “viable surface detection method.” There are several methode for visible surtace Getection In computer graphics. Here are ters Algorithm: This Is one of the Simplest "visible surface detection rendered from Back {0 front based on their distance from the ewer: This method ean sufler from Such as sorting rors. and rendering sriacte ZButtering: Zbutferng fea more advanced technique that uses 2 depth buffer fo keop tack of the depth (distance ch pee. Whar ne, te depth of each phe ts compared to the depth vale. In the butfr if the now phe is closer to the ower, itis rendered, otherwise. t Is Siscarded. Zutfering is efficent and handles ‘complex scenes well, but it Fequies addtional memory forthe depth bute Scantine Algorithm: |The _scantine algorithm works by aviding the scene Into horizontal (scanlines) and processing each scanine to determine the Visible surfaces. This method is commonly Used for rendering polygons and handling ‘complex scenes witn overlapping objects Ray Casting: Ray casting works by casting rays from the views's eye though each hel om the seroen and ino the scene. The Fay is thon tested for intersections with objects inthe scone. This method Is computationally intensive but ean produce high-quality images wih realist igting sec