中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
fast high quality k-d tree construction algorithm
Author: Qian Yin-Ling ; Liang Xiao ; Zhang Yan-Ci
Keyword: Algorithms ; Forestry ; Ray tracing
Source: Ruan Jian Xue Bao/Journal of Software
Issued Date: 2012
Volume: 23, Issue:UPPL.2, Pages:158-167
Indexed Type: EI
Department: (1) State Key Laboratory of Computer Science Institute of Software The Chinese Academy of Sciences Beijing 100190 China; (2) College of Computer Science Sichuan University Chengdu 610065 China; (3) College of Computer Science Southwest Petroleum University Chengdu 610500 China; (4) State Key Laboratory of Fundamental Science on Synthetic Vision Sichuan University Chengdu 610065 China
Abstract: This paper proposes a high quality k-D tree constructing algorithm for interactive dynamic scene ray tracing. Combined with the fact that scene primitives were usually well distributed, a reasonable formula is derived from the basic k-D tree traversal cost function to represent the traversal cost for sequential positions in node. After dividing the bounding box of splitting node to uniform bin series, the best splitting position is directly computed by resolving the analytic solution of the cost formula. To guarantee superior rendering performance for different ray tracing applications, the study raised several sensible functions for sub-space number computing in different situations. Experimental results proved that this algorithm was suitable for scenes with various kinds of primitive distribution, and it can be used for full k-D tree construction. Great construction efficiency was obtained with the best splitting quality maintained. © Copyright 2012, Editorial Department of Journal of Software.
English Abstract: This paper proposes a high quality k-D tree constructing algorithm for interactive dynamic scene ray tracing. Combined with the fact that scene primitives were usually well distributed, a reasonable formula is derived from the basic k-D tree traversal cost function to represent the traversal cost for sequential positions in node. After dividing the bounding box of splitting node to uniform bin series, the best splitting position is directly computed by resolving the analytic solution of the cost formula. To guarantee superior rendering performance for different ray tracing applications, the study raised several sensible functions for sub-space number computing in different situations. Experimental results proved that this algorithm was suitable for scenes with various kinds of primitive distribution, and it can be used for full k-D tree construction. Great construction efficiency was obtained with the best splitting quality maintained. © Copyright 2012, Editorial Department of Journal of Software.
Language: 中文
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/15125
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Qian Yin-Ling,Liang Xiao,Zhang Yan-Ci. fast high quality k-d tree construction algorithm[J]. Ruan Jian Xue Bao/Journal of Software,2012-01-01,23(UPPL.2):158-167.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Qian Yin-Ling]'s Articles
[Liang Xiao]'s Articles
[Zhang Yan-Ci]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Qian Yin-Ling]‘s Articles
[Liang Xiao]‘s Articles
[Zhang Yan-Ci]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace