Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Szirmay-Kalos, László
Havran, Vlastimil
Balázs, Benedek
Szécsi, László

dblp
dblp
dblp
dblp

Not MPG Author(s):

Szirmay-Kalos, László
Balázs, Benedek
Szécsi, László

Editor(s):

Chalmers, Alan

dblp

Not MPII Editor(s):

Chalmers, Alan

BibTeX cite key*:

Havran2002:SCCG

Title, Booktitle

Title*:

On the Efficiency of Ray-shooting Acceleration Schemes

Booktitle*:

Proceedings of the 18th Spring Conference on Computer Graphics (SCCG 2002)

Event, URLs

URL of the conference:

http://www.sccg.sk

URL for downloading the paper:


Event Address*:

Budmerice, Slovakia

Language:

English

Event Date*
(no longer used):

-- April, 25-27, 2002

Organization:


Event Start Date:

25 April 2002

Event End Date:

27 April 2002

Publisher

Name*:

ACM Siggraph

URL:


Address*:

New York, USA

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

89-98

Year*:

2002

VG Wort Pages:


ISBN/ISSN:

1-58113-608-0

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

This paper examines the efficency of different ray-shooting acceleration schemes,
including the uniform space subdivision, octree and kd-tree. We use simple computational
model , which assume that the objects are uniformly distributed in space.
The efficiency is characterized by two measures, including the expected
number of ray-object intersections needed to identified the first intersected
object, and the expected number of steps on the space partitioning data structure.
We can come to the interesting conclusion that these numbers are constant and
are independent of the number of objects in the scene. The number of intersections
is determined by how well the cells of the partitioning data structure enclose
the objects. Such analysis helps to understand why kd-tree is better than octree
and uniform space subdivision and provides hints to improve their implementation.

Keywords:

Ray-tracing, Uniform subdivision, Octree, KD-tree, Performance analysis



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Computer Graphics Group

Audience:

Expert

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Havran2002:SCCG,
AUTHOR = {Szirmay-Kalos, L{\'a}szl{\"o} and Havran, Vlastimil and Bal{\'a}zs, Benedek and Sz{\'e}csi, L{\'a}szl{\"o}},
EDITOR = {Chalmers, Alan},
TITLE = {On the Efficiency of Ray-shooting Acceleration Schemes},
BOOKTITLE = {Proceedings of the 18th Spring Conference on Computer Graphics (SCCG 2002)},
PUBLISHER = {ACM Siggraph},
YEAR = {2002},
PAGES = {89--98},
ADDRESS = {Budmerice, Slovakia},
ISBN = {1-58113-608-0},
}


Entry last modified by Christine Kiesel, 03/12/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Vlastimil Havran
Created
05/22/2002 06:27:42 PM
Revisions
5.
4.
3.
2.
1.
Editor(s)
Christine Kiesel
Christine Kiesel
Thomas Annen
Christine Kiesel
Christine Kiesel
Edit Dates
04.09.2003 17:50:44
13.08.2003 10:54:53
13.08.2003 10:47:42
09.05.2003 16:30:49
04/15/2003 02:45:32 PM
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section