Find results with:

Add another field

Search by date

to

Searching collections:

Dartmouth Dissertations

Add or remove collections

Home Dartmouth Dissertations Page 1

Reference URL

To link to the entire object, paste this link in email, IM or document

To embed the entire object, paste this HTML in website

To link to this page, paste this link in email, IM or document

To embed this page, paste this HTML in website

Sampling for complexity in rendering / by Jiawei Ou.

you wish to report:

Your comment:

Your Name:

Submit

Cancel

...

Back to top

Powered by CONTENTdm®

Author	Ou, Jiawei.
Title	Sampling for complexity in rendering / by Jiawei Ou.
Date	2013
Abstract	As the visual effect and movie industries are striving for realism and high fidelity images, physically based lighting, global illumination, realistic materials, and highly tessellated geometry are gradually accepted and used in movie and game industries. Modern computer graphics has reached an unprecedented level of complexity. As a result, brute-force rendering methods become prohibitively expensive. For decades, computer graphics researchers have been tackling the complexity in rendering by introducing more advanced Monte Carlo integrators,efficient sampling and reconstruction algorithms, effective filtering techniques, sophisticated data structures, and new hardware architectures. In this thesis, we focus on deriving better sampling algorithms to improve the rendering efficiency under complex scene settings. In this context, we explore several areas in computer graphics where sampling algorithms play an important role in improving the overall performance of the renderer: (1). We introduce progressive rendering algorithms as alternatives of full-quality, final rendering, under complex settings. We then conduct a user study to evaluate the effectiveness of several progressive rendering algorithms in the context of appearance design tasks. (2). We conduct an investigation into high-quality rendering algorithms for scenes with complex lighting, and propose an efficient many-light algorithm, which renders a few hundred thousand virtual point lights for global illumination, based on matrix slice sampling and light clustering. (3). We investigate importance sampling algorithms for bidirectional scattering distribution functions (bsdfs), and present an importance sampling algorithm for hair bsdf, which can drastically reduce the number of samples required for high quality hair rendering. (4). We look into the problem of out-of-core rendering with massive datasets which cannot fit in the main memory at one time. First, we present an efficient approach to construct out-of-core bounding box hierarchy (BVH). Then, we p
Description	xv, 184 leaves : ill. (some col.) 28 cm.
Format	application/pdf
Advisor	Fabio Pellacini, Andrew T. Campbell, Devin J. Balkcom, Jaroslav Krivanek
College	Dartmouth College. Department of Computer Science.
Issuing Body	Dartmouth Dissertations are made available through the Dartmouth Digital Library.
Degree	Thesis (Ph.D.)--Dartmouth College.
Copyright	All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means without permission in writing from the author.
DOI	http://dx.doi.org/10.1349/ddlp.994

Title	Page 1
Full Text	SAMPLING FOR COMPLEXITY IN RENDERING A Thesis Submitted to the Faculty in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science by Jiawei Ou DARTMOUTH COLLEGE Hanover, New Hampshire May, 2013 Examining Committee: Fabio Pellacini, Chair Andrew T. Campbell Devin J. Balkcom Jaroslav Kˇrivánek F. Jon Kull, Ph.D. Dean of Graduate Studies

	All
	Pages Enter page numbers or page ranges separated by commas. For example: 1,3,5-12

Find results with:

Searching collections:

Home Dartmouth Dissertations Page 1

Sampling for complexity in rendering / by Jiawei Ou.

Page 1

Object Description

Description

Sampling for complexity in rendering / by Jiawei Ou.

Sampling for complexity in rendering / by Jiawei Ou.