On Improving KD-Trees for Ray Shooting

Havran, Vlastimil; Bittner, Jiri

Local TagsRelease HistoryDetailsSummary

On Improving KD-Trees for Ray Shooting

Havran, V., & Bittner, J. (2002). On Improving KD-Trees for Ray Shooting. Journal of WSCG, 10, 209-216.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-300F-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3010-E

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Havran, Vlastimil¹, Author
Bittner, Jiri, Author

Affiliations:
1Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047

Content

show

hide

Free keywords: -

Abstract: Efficient ray shooting algorithm is inherently required by many computer graphics algorithms, particularly in image synthesis. Practical ray shooting algorithms aiming at the average-case complexity use some underlying spatial data structure such as $kd$-tree. We show the new termination criteria algorithm that improves the space and time complexity of the $kd$-tree construction. It provides efficient ray-shooting queries and does not require any specific constants from a user. Further, we show how to apply a novel clipping algorithm into the $kd$-tree within construction phase in order to improve its properties.

Details

show

hide

Language(s): eng - English

Dates: Modified: 2003-09-04Date issued: 2002

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 202203
Other: Local-ID: C125675300671F7B-5714A971F0EBE103C1256BC1005BA14C-Havran2001

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Journal of WSCG

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 10 Sequence Number: - Start / End Page: 209 - 216 Identifier: ISSN: 1213-6972