Geri Dön

Üç boyutlu canlandırma sisteminde gerçeğe benzetme

Başlık çevirisi mevcut değil.

  1. Tez No: 39800
  2. Yazar: HÜNKAR ÜNVERDİ
  3. Danışmanlar: DOÇ.DR. FÜSUN TUNALI
  4. Tez Türü: Yüksek Lisans
  5. Konular: Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrol, Computer Engineering and Computer Science and Control
  6. Anahtar Kelimeler: Bilgisayar destekli benzetim, Bilgisayar yazılımları, Gerçekçi görüntü, Üç boyutlu canlandırma sistemi, Computer aided simulation, Computer softwares, Realistic images, Three dimensional animation system
  7. Yıl: 1994
  8. Dil: Türkçe
  9. Üniversite: İstanbul Teknik Üniversitesi
  10. Enstitü: Fen Bilimleri Enstitüsü
  11. Ana Bilim Dalı: Belirtilmemiş.
  12. Bilim Dalı: Belirtilmemiş.
  13. Sayfa Sayısı: Belirtilmemiş.

Özet

Özet yok.

Özet (Çeviri)

SUMMARY The hidden line/hidden surface problem is öne of the more difficult in computer graphics. Hidden line/hidden surface algorithms attem.pt to determine the lines edges, surfaces ör volumes that öne visible ör invisible to an observer located at a specific point in space. The complexity of hidden line/hidden surface problem has resulted in a large number of diverse solutions. Many of diverse solutions. Many of these öne för specialised applications. There is no best solution to the hidden line/hidden surface problem. Ali hidden line/hidden surface algorithms involve sorting. The order in which sorting of the geometric co- ordinates occurs is generally immaterial to the efficiency of the algorithms. We used the z-buffer algorithm for the hidden surface algorithm. The technique was originally proposed by Catmull and is an image space algorithm. A frame buffer is used to store the attributes of each pixel in image space. The z buffer is a separate depth buffer used to store the z co-ordinate ör depth of every visible pixel in image space. in use, the depth ör z value of a new pixel to be written to the frame buffer is compared to the depth of that pixel stored in the z buffer. If the comparison indicates that the new pixel is in front of the pixel stored in the frame buffer, then the new pixel is written to the frame buffer and the z buffer updated with the new z value. If not, no action is taken. it handles the hidden surface problem and display of complex surface intersections trivially. Simply defined, rendering is process of producing realistle images ör pictures. Producing realistle images involves both physics and psychology. Light, i.e. electromagnetic energy, reaches the eye after viiiu = AQ / AB Iq = u*Ib + (1-u)*Ia w = BR / BC Ir = w*Ic + (1-w)*Ib t = QP / QR Ip = t*lR + (l-t)*lQ 0=<u,w, t<=l A method due to Bui-Tuong Phong (1975) overcomes some of the disadvantages of Gouraud shading and specular reflection can be successfully incorporated in the scheme. Whereas Gouraud shading interpolates intensity values along a scan line, Phong shading interpolates the normal vector along the scan line. The illumination model is then applied at each pixel, using the interpolated normal to determine the intensity. This technique gives a better local approximation to the surface curvature and hence a better rendering of the surface. Phong shading first approximates the surface curvature at polygonal vertices by approximating the normal at the vertex. A bilinear interpolation is then used to determine the normal at each pixel. Additional difficulties are exhibited by both Gouraud and Phong shading when used in animation sequences. u = AQ / AB no = u*nB + (l-u)*nA w = BR / BC m = w*nc + (l-w)*nB t = QP / QR np = t*m + (l-t)*nQ 0=<u,w, t<=l XISUMMARY The hidden line/hidden surface problem is öne of the more difficult in computer graphics. Hidden line/hidden surface algorithms attem.pt to determine the lines edges, surfaces ör volumes that öne visible ör invisible to an observer located at a specific point in space. The complexity of hidden line/hidden surface problem has resulted in a large number of diverse solutions. Many of diverse solutions. Many of these öne för specialised applications. There is no best solution to the hidden line/hidden surface problem. Ali hidden line/hidden surface algorithms involve sorting. The order in which sorting of the geometric co- ordinates occurs is generally immaterial to the efficiency of the algorithms. We used the z-buffer algorithm for the hidden surface algorithm. The technique was originally proposed by Catmull and is an image space algorithm. A frame buffer is used to store the attributes of each pixel in image space. The z buffer is a separate depth buffer used to store the z co-ordinate ör depth of every visible pixel in image space. in use, the depth ör z value of a new pixel to be written to the frame buffer is compared to the depth of that pixel stored in the z buffer. If the comparison indicates that the new pixel is in front of the pixel stored in the frame buffer, then the new pixel is written to the frame buffer and the z buffer updated with the new z value. If not, no action is taken. it handles the hidden surface problem and display of complex surface intersections trivially. Simply defined, rendering is process of producing realistle images ör pictures. Producing realistle images involves both physics and psychology. Light, i.e. electromagnetic energy, reaches the eye after viiiu = AQ / AB Iq = u*Ib + (1-u)*Ia w = BR / BC Ir = w*Ic + (1-w)*Ib t = QP / QR Ip = t*lR + (l-t)*lQ 0=<u,w, t<=l A method due to Bui-Tuong Phong (1975) overcomes some of the disadvantages of Gouraud shading and specular reflection can be successfully incorporated in the scheme. Whereas Gouraud shading interpolates intensity values along a scan line, Phong shading interpolates the normal vector along the scan line. The illumination model is then applied at each pixel, using the interpolated normal to determine the intensity. This technique gives a better local approximation to the surface curvature and hence a better rendering of the surface. Phong shading first approximates the surface curvature at polygonal vertices by approximating the normal at the vertex. A bilinear interpolation is then used to determine the normal at each pixel. Additional difficulties are exhibited by both Gouraud and Phong shading when used in animation sequences. u = AQ / AB no = u*nB + (l-u)*nA w = BR / BC m = w*nc + (l-w)*nB t = QP / QR np = t*m + (l-t)*nQ 0=<u,w, t<=l XIOrientation interpolation is the most important problem in the key frame method computations. As known, rotation is represented by a matrix of 3x3 (4x4 for homogenous transformations) in traditional method. If an orientation is described by consecutive rotations, the resultant orientation matrix has dependent parameters whose dependency degree is the number of the operations. This shos that there exists more than one parameter to interpolate which causes complicated computations. As interpolation can not be done independently for each parameter, undesired situations will occur. In order to get rid of this problem, quaternions are used in this thesis. Quaternions were defined by Sir William Hamilton, while he had been studying“expansion of complex plane to the tree dimensional space”, in 1843. In this thesis, 3D Rendering techniques, 3D Hidden Line/Surface techniques are examined. 3D Rendering and Animation Software is developed. Developer system provides an interface for 3D rendering, rotation and animation.“Key Frame”technique is used in animation. Hidden line/surface algorithms are examined and compared. Z buffer hidden line/surface algorithm which have more advantages is chosen. Half tone and smooth shading algorithms are examined and compared as a rendering algorithms. Simple, Gouraud and Phong shading algorithms are used in software. Quaternions are used in orientation interpolation. Software uses SVGA256 color graphics. xn

Benzer Tezler

  1. Tez No

    781767

    Contribution a la recherche d'un cadre juridique pour un droit international de laconcurrence plus efficace

    Daha etkin bir uluslararası rekabet için hukuki çerçeve arayışı

    ALİ CENK KESKİN

    Doktora

    Fransızca

    Fransızca

    2009

    HukukGalatasaray Üniversitesi

    Kamu Hukuku Ana Bilim Dalı

    PROF. DR. JEAN MARC SOREL

    PROF. DR. HALİL ERCÜMENT ERDEM

  2. Tez No

    244740

    Yüz ifadelerinin duygusal olarak değişikliğe uğratılıp üç boyutlu yüz canlandırması üretilmesi ve sistemin imge eşleme ile geliştirilmesi

    Producing three?dimensional facial animation by modifying facial expressions emotionally and improving the system with image matching

    YUSUF OSMANLIOĞLU

    Yüksek Lisans

    Türkçe

    Türkçe

    2009

    Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve KontrolTobb Ekonomi ve Teknoloji Üniversitesi

    Bilgisayar Mühendisliği Bölümü

    PROF. DR. BÜLENT ÖZGÜÇ

    YRD. DOÇ. DR. M. FATİH DEMİRCİ

  3. Tez No

    372423

    Üç boyutlu bilgisayarlı canlandırma sineması yapım öncesi aşamalarında tasarım sorunları

    Design problems in pre-production phase of three dimensional computer animation cinema

    ÇAĞDAŞ ÜLGEN

    Yüksek Lisans

    Türkçe

    Türkçe

    2014

    Sahne ve Görüntü SanatlarıDokuz Eylül Üniversitesi

    Film Tasarımı Ana Sanat Dalı

    YRD. DOÇ. DR. KORKUT ÖZTEKİN

  4. Tez No

    556075

    Canlandırma sinemasında kullanılan autodesk 3ds max programında catrig yazılımının sınırlılıkları ve temel prensiplere ilişkin çözüm üretme

    Limitedness of autodesk 3ds max software's catrig extension and generating solutions concerning basic principles of animation

    MESUT ÇORAK

    Yüksek Lisans

    Türkçe

    Türkçe

    2019

    Sahne ve Görüntü SanatlarıGazi Üniversitesi

    Uygulamalı Sanatlar Eğitimi Ana Bilim Dalı

    PROF. BİRSEN ÇEKEN

  5. Tez No

    246713

    3D mesh animation system targeted for multi-touch environments

    Çoklu dokunmatik ortamlar için 3 boyutlu model canlandırması

    DUYGU CEYLAN

    Yüksek Lisans

    İngilizce

    İngilizce

    2009

    Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrolİhsan Doğramacı Bilkent Üniversitesi

    Bilgisayar Mühendisliği Bölümü

    YRD. DOÇ. DR. TOLGA K. ÇAPIN

Geri Dön