支援動態場景之懷氏光線追跡之演算法及硬體架構設計

張誠豪

doi:10.6342/NTU.2009.00981

3.236.156.34，Hello！

Close
Search Quick Search Advanced Search Publication Search	Personal Service Member Login Searching History Use Bonus Card SYMSKAN
Browse Browse by University of Graduate Thesis Browse by Pinyin of Graduate Thesis Browse by Conference Proceedings Topic Browse by Conference Proceedings Publisher Browse by Pinyin of Conference Proceedings Browse by eBook Category Browse by eBook Topic Browse by eBook Publisher
Customer Services Authorize Airiti Recommend a Journal

Search Symbol (Half-width)	Description of Search Symbols
Space	"AND" indicates the intertwining of key terms used in a search
Double Quotation Marks ("") ( " " )	Double quotation marks indicate the beginning and end of a phrase, and the search will only include terms that appear in the same order of those within the quotations. Example: "image process" ： " image process "
?	Indicates a variable letter. Entering two ? will indicate two variable letters, and so on. Example: "Appl?", search results will yield apple, apply… e , appl y … ( (often used to English word searches) )
*	Indicates an unlimited number of variable letters to follow, from 1~n. Example: Enter "appl*", search results will yield apple, apples, apply, applied, application…(often used in English word searches) e , appl es , appl y , appl ied , appl ication … ( (often used to English word searches) )
AND、OR、NOT	Boolean logic combinations of key words is a skill used to expand or refine search parameters. (1) AND (1) AND: Refines search parameters (2) OR (2) OR: Expands search parameters (3) NOT: Excludes irrelevant parameters

DOI stands for Digital Object Identifier （ D igital O bject I dentifier ） ,
and is the unique identifier for objects on the internet. It can be used to create persistent link and to cite articles.

Using DOI as a persistent link

To create a persistent link, add「http://dx.doi.org/」「 http://dx.doi.org/ 」 before a DOI.
For instance, if the DOI of an article is 10.5297/ser.1201.002 , you can link persistently to the article by entering the following link in your browser: http://dx.doi.org/ 10.5297/ser.1201.002 。
The DOI link will always direct you to the most updated article page no matter how the publisher changes the document's position, avoiding errors when engaging in important research.

Cite a document with DOI

When citing references, you should also cite the DOI if the article has one. If your citation guideline does not include DOIs, you may cite the DOI link.

DOIs allow accurate citations, improve academic contents connections, and allow users to gain better experience across different platforms. Currently, there are more than 70 million DOIs registered for academic contents. If you want to understand more about DOI, please visit airiti DOI Registration （ doi.airiti.com ）。

Data Source

College of Electrical Engineering & Computer Science > Graduate Institute of Electronical Engineering
Engineering > Electrical Engineering

Bibliography Management Tool

Related Links

Report an Issue

Purchase Single Articles

Download PDF

支援動態場景之懷氏光線追跡之演算法及硬體架構設計

Algorithm and System Architecture Design of Whitted-style Ray Tracing for Dynamic Scenes

張誠豪 , Masters　　Advisor：簡韶逸　　

英文 DOI： 10.6342/NTU.2009.00981

三維繪圖；光線追跡；懷氏光確追跡；層次包圍盒；系統單晶片； 3D computer graphic ； ray tracing ； Whitted style ray tracing ； BVH ； SOC

Abstract │ Reference (104) │ Altmetrics

Abstract 〈TOP〉

Parallel Abstract 〈TOP〉

Ray tracing is an algorithm for synthesizing a realistic image in 3D computer graph-
ics. The advantage of this algorithm is supporting not only the visibility of scene and
shadow but also indirect lighting effects such as reflection and refraction. However,
the computation complexity of ray tracing is very large due to large number of ray-
primitive intersections especially for rendering the indirect lighting effect. Although
there are many accelerating algorithms using data special structures to accelerate the
tracing process, the real time performance is still hard to achieve. Besides, the inter-
active applications with 3D graphics are popular such as 3D gameing, where the scene
may be changed in every frame. This means that the data structure building time is
also an important issue for real time rendering. Aiming to solve these problems, this
thesis proposes a system architecture which uses ASIC to accelerate ray tracing pro-
cess. Instead of considering the primary rays only, secondary rays are also considered
to render more realistic scenes, which is called as Whitted-style ray tracing. By using
packet-based ray traversal algorithm and frustum culling not only in primary rays but
also in shadow rays and secondary rays, the steps of ray traversing are reduced. Be-
sides, aiming to support interactive applications, the data structure should be changed
dynamically. Instead of rebuilding data structure every frames, we use updating based
algorithms such as refit and insertion to update the data structure of the previous frame.
By using updating based algorithm, the building time of new data structure is short and
the traversing result is correct after the scene changes. In the hardware architecture of
this system, multi-threading is used. Moreover, the computation for finding the inser-
tion positions in insertion algorithm and shading are integrated into a specific unit to
enable hardware sharing. This architecture is System-on-a-chip composed of CPU, our
rendering engine, system memory and other peripherals. For an image in resolution of
352   288, the system can achieve 3–15 frames per second and also support dynamic scenes.

Reference ( 104 ) 〈TOP〉

[1] Solomon Boulos, Dave Edwards, J Dylan Lacewell, Joe Kniss, Jan Kautz, Peter
連結：
Shirley, and Ingo Wald, “Packet-based whitted and distribution ray tracing,” in
連結：
[2] Samuel R. Buss, 3D Computer Graphics: A Mathematical Introduction with
連結：
[5] Andrew S and Glassner, An Introduction to Ray tracing (The Morgan Kaufmann
連結：
Peters, Ltd, 2003.
連結：

Altmetrics

〈TOP〉

E-mail ：

When an article is available to download, a notice will be sent to your mailbox address.

E-mail ：