Referenced Items are not available for this document.
KD-Tree is an important accelerating structure for ray-tracing based realistic rendering. How to construct kd-tree efficiently is very crucial for ray tracing performance. In this paper, we present a fast construction algorithm. It is based on SAH cost estimation function and adopts a clever way to keep sorting order without sorting every time. Thus we reduce the complexity to O(NlogN), which is the asymptotic lower bound for building kd-trees.
Published in:
Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on
Date of Conference: 11-13 Dec. 2009
- Page(s):
- 1 - 4
- E-ISBN :
- 978-1-4244-4507-3
- Print ISBN:
- 978-1-4244-4507-3
- INSPEC Accession Number:
- 11024310
- Conference Location :
- Wuhan
- Digital Object Identifier :
- 10.1109/CISE.2009.5365130
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
