MC Ray Tracing: Part II, Importance Sampling Sung-Eui Yoon ( ) - - PowerPoint PPT Presentation

mc ray tracing part ii importance sampling
SMART_READER_LITE
LIVE PREVIEW

MC Ray Tracing: Part II, Importance Sampling Sung-Eui Yoon ( ) - - PowerPoint PPT Presentation

CS580: MC Ray Tracing: Part II, Importance Sampling Sung-Eui Yoon ( ) Course URL: http://sglab.kaist.ac.kr/~sungeui/GCG Class Objectives: I mportance sampling for: Direct terms Lights I ndirect terms 2 Performance


slide-1
SLIDE 1

CS580:

MC Ray Tracing: Part II, Importance Sampling

Sung-Eui Yoon (윤성의)

Course URL: http://sglab.kaist.ac.kr/~sungeui/GCG

slide-2
SLIDE 2

2

Class Objectives:

  • I mportance sampling for:
  • Direct terms
  • Lights
  • I ndirect terms
slide-3
SLIDE 3

3

Performance and Error

  • Want better quality with smaller number of

samples

  • Fewer samples  better performance
  • Stratified sampling
  • Quasi Monte Carlo: well-distributed samples
  • Faster convergence
  • I mportance sampling: next-event estimation
slide-4
SLIDE 4

4

slide-5
SLIDE 5

5

slide-6
SLIDE 6

6

Importance Sampling

slide-7
SLIDE 7

7

Importance Sampling

slide-8
SLIDE 8

8

Comparison

  • With and without considering direct

illumination

  • 16 samples / pixel

From kavita’s slides

slide-9
SLIDE 9

9

slide-10
SLIDE 10

10

slide-11
SLIDE 11

11

slide-12
SLIDE 12

12

slide-13
SLIDE 13

13

slide-14
SLIDE 14

14

slide-15
SLIDE 15

15

slide-16
SLIDE 16

16

slide-17
SLIDE 17

17

slide-18
SLIDE 18

18

slide-19
SLIDE 19

19

slide-20
SLIDE 20

20

slide-21
SLIDE 21

21

slide-22
SLIDE 22

22

Anti-aliasing

From kavita’s slides

slide-23
SLIDE 23

23

slide-24
SLIDE 24

24

Do not take visibility into account!

slide-25
SLIDE 25

25

Research on Many Lights

  • Ward 91
  • Sort lights based on their maximum

contribution

  • Pick bright lights based on a threshold
  • Do not consider visibility
  • Many other papers
  • One of recent works:
  • LightCuts: A Scalable Approach to I llumination,

SI G. 05, Walter et al.

slide-26
SLIDE 26

26

slide-27
SLIDE 27

27

slide-28
SLIDE 28

28

slide-29
SLIDE 29

29

slide-30
SLIDE 30

30

y  z  x

slide-31
SLIDE 31

31

slide-32
SLIDE 32

32

slide-33
SLIDE 33

33

slide-34
SLIDE 34

34

slide-35
SLIDE 35

35

slide-36
SLIDE 36

36

slide-37
SLIDE 37

37

slide-38
SLIDE 38

38

slide-39
SLIDE 39

39

slide-40
SLIDE 40

40

slide-41
SLIDE 41

41

slide-42
SLIDE 42

42

General GI Algorithm

  • Design path generators
  • Path generators determine efficiency of GI

algorithm

  • Black boxes
  • Evaluate BRDF, ray intersection, visibility

evaluations, etc

slide-43
SLIDE 43

43

Class Objectives were:

  • I mportance sampling for:
  • Direct terms
  • Lights
  • I ndirect terms