The Expected Running Time of Hierarchical Collision Detection
Poster
| Poster |
One-Page Subm. |
Suppl. Material |
Slides |
| PDF (1.8 MB) |
PDF (1.6 MB) |
PDF (1.4 MB) |
PDF (0.6 MB) |
Abstract
We propose a theoretical approach to analyze the average-case
running time of hierarchical collision detection that utilizes
bounding volume hierarchies. It can explain the O(log n) behavior
that has been observed for a long time. Our theoretical analysis is
verified by practical experiments.
BibTeX entry
@INPROCEEDINGS{Zach05d,
author = "Jan Klein and Gabriel Zachmann",
booktitle = "SIGGRAPH 2005, Poster",
month = aug,
title = "The Expected Running Time of Hierarchical Collision Detection",
year = "2005",
address = "Los Angeles",
url = "http://www.gabrielzachmann.org/",
}
In case of problems
In case of problems, please don't hesitate to
contact me.
(For instance, if your host is not registered by the world-wide Domain
Name Service (DNS), then you will not be able to ftp ...)
Gabriel Zachmann
Last modified:
Wed Mar 22 12:48:29 MET 2006