TU Wien Rendering #37 - Manifold Exploration
3:24

TU Wien Rendering #37 - Manifold Exploration

Two Minute Papers 05.06.2015 5 885 просмотров 74 лайков

Machine-readable: Markdown · JSON API · Site index

Поделиться Telegram VK Бот
Транскрипт Скачать .md
Анализ с AI
Описание видео
That pesky torus enclosed in the glass cube again! Since it contains lots of SDS light paths, it is the bane of many rendering algorithms. However, it is no match for Wenzel Jakob's Manifold Exploration technique that explicitly looks for these paths and runs an equation solving system to find and render these light paths that are difficult or impossible to render with traditional techniques. About the course: This course aims to give an overview of basic and state-of-the-art methods of rendering. Offline methods such as ray and path tracing, photon mapping and many other algorithms are introduced and various refinement are explained. The basics of the involved physics, such as geometric optics, surface and media interaction with light and camera models are outlined. The apparatus of Monte Carlo methods is introduced which is heavily used in several algorithms and its refinement in the form of stratified sampling and the Metropolis-Hastings method is explained. At the end of the course students should be familiar with common techniques in rendering and find their way around the current state-of-the-art of the field. Furthermore the exercises should deepen the attendees' understanding of the basic principles of light transport and enable them to write a simple rendering program themselves. These videos are the recordings of the lectures of 2015 at the Teschnische Universität Wien by Károly Zsolnai and Thomas Auzinger Course website and slides → http://www.cg.tuwien.ac.at/courses/Rendering/ Subscribe → http://www.youtube.com/subscription_center?add_user=keeroyz Web → https://cg.tuwien.ac.at/~zsolnai/ Twitter → https://twitter.com/karoly_zsolnai

Оглавление (4 сегментов)

<Untitled Chapter 1>

this is the work of ventaja cop he's a super-smart really brilliant guy he extended the beach metropolis algorithm to handle SDS transport better now how is this possible what I have written here is the very scientific way stating what is really happening the most difficult paths form a manifold in path space and you can grab this manifold and sample this exhaustively with an equation solving system let's take a

Intuition

look at the intuition this is super useful but very challenging to understand and implement for ordinary people now what is exactly happening here so we have the diffuse balance this is xB and we hit the light source after that which is XC on the upper right and between the B and the C we have two specular bounces and imagine that I am fixing the xB + XC these are two fixed vertices and if I have this glass egg in between that is perfectly specular then I can write an algorithm that computes what should be the exact outgoing direction from this diffuse vertex in order to exactly hit that XC point there is only one possible path because we have perfectly specular inter reflections in between so what should be this outgoing direction from XP this is the equation solving system that we are interested in how do the results look

Results

like well you can compare it to metropolis light transport that is either very noisy or it misses some of the light paths completely in these very difficult test cases the manifold exploration part razor outperforms all of the existing algorithms PSS m LT is the Callahan's time original feature metropolis one more example a beach metropolis BER pt I will tell you in a second what that is C Kellerman's metropolis light transport algorithm and D manifold exploration path tracing events are was kind enough to put I think 20 minute talk about this work on his website so make sure to check it out it is really well illustrated explained make sure to check it out let's take a look how the

How the Algorithm Converges in Time

algorithm converges in time take a look at this beauty lots of SDS light paths and in the first ten minutes you already have some degree of convergence that would take days or possibly forever with other algorithms it's pretty amazing one of my favorites out there here you can see side-by-side Kellerman's metropolis light transport versus manifold exploration part racing it's difficult not to get excited about this right

Другие видео автора — Two Minute Papers

Ctrl+V

Экстракт Знаний в Telegram

Экстракты и дистилляты из лучших YouTube-каналов — сразу после публикации.

Подписаться

Дайджест Экстрактов

Лучшие методички за неделю — каждый понедельник