• Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
View Item 
  •   DSpace Home
  • Mühendislik Fakültesi
  • Bilgisayar Mühendisliği Bölümü
  • Bilgisayar Mühendisliği Bölümü Tez Koleksiyonu
  • View Item
  •   DSpace Home
  • Mühendislik Fakültesi
  • Bilgisayar Mühendisliği Bölümü
  • Bilgisayar Mühendisliği Bölümü Tez Koleksiyonu
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Example Based Soft-Body Simulation on Graphics Processing Units

View/Open
Tez Metni (3.832Mb)
Date
2019-07
Author
Koç, Emircan
xmlui.dri2xhtml.METS-1.0.item-emb
Acik erisim
xmlui.mirage2.itemSummaryView.MetaData
Show full item record
Abstract
Nowadays Soft-body Physics Simulations are used in lots of different areas such as movies, videos and video games. Depending on the application, use of simulation improves realism, fun and teaching factor thus creates more quality in the product. Generally, Soft-body Physics Simulations are very resource consuming operations. In this thesis we proposed a Soft-body Physics Simulation algorithm. Aim of this proposed algorithm is to address three of the big problems of Soft-body Physics Simulations; performance, visual quality and ease of use. Proposed algorithm uses precomputed soft-body physics simulation results and creates its outputs by using precomputed simulation results as examples for a potential solution. Method of using examples simplifies and reduces expensive computations thus improves performance. Visual quality depends on given examples. By simply improving visual quality of examples, visual quality of simulation can be increased. Algorithm only creates results by using examples so there cannot be any unexpected outputs, thus this improves ease of use. Proposed Soft-body Physics Simulation algorithm includes independent tasks and can be implemented fully in parallel. As a result, it can use full potential of graphical processing units, which became exceedingly popular in parallel computation for very promising performance. Proposed algorithm has a time complexity of O(n) where n being the number of vertices. Even in cases that contains three dimensional models that have millions of triangles proposed algorithm computes result in couple of milliseconds. It can easily be used in real-time applications.
URI
http://hdl.handle.net/11655/9376
xmlui.mirage2.itemSummaryView.Collections
  • Bilgisayar Mühendisliği Bölümü Tez Koleksiyonu [162]
Hacettepe Üniversitesi Kütüphaneleri
Açık Erişim Birimi
Beytepe Kütüphanesi | Tel: (90 - 312) 297 6585-117 || Sağlık Bilimleri Kütüphanesi | Tel: (90 - 312) 305 1067
Bizi Takip Edebilirsiniz: Facebook | Twitter | Youtube | Instagram
Web sayfası:www.library.hacettepe.edu.tr | E-posta:openaccess@hacettepe.edu.tr
Sayfanın çıktısını almak için lütfen tıklayınız.
Contact Us | Send Feedback



DSpace software copyright © 2002-2016  DuraSpace
Theme by 
Atmire NV
 

 


DSpace@Hacettepe
huk openaire onayı
by OpenAIRE

About HUAES
Open Access PolicyGuidesSubcriptionsContact

livechat

sherpa/romeo

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsTypeDepartmentPublisherLanguageRightsxmlui.ArtifactBrowser.Navigation.browse_indexFundingxmlui.ArtifactBrowser.Navigation.browse_subtypeThis CollectionBy Issue DateAuthorsTitlesSubjectsTypeDepartmentPublisherLanguageRightsxmlui.ArtifactBrowser.Navigation.browse_indexFundingxmlui.ArtifactBrowser.Navigation.browse_subtype

My Account

LoginRegister

Statistics

View Usage Statistics

DSpace software copyright © 2002-2016  DuraSpace
Theme by 
Atmire NV