| gzipped Postscript | ||
|---|---|---|
| Print: | VMV'03 (520 kB) | VMV'03 (620 kB) |
| Screen: | VMV'03 (400 kB) | VMV'03 (550 kB) |
| Slides: | VMV'03 (380 kB) | VMV'03 (1 MB) |
| XViD (3.6 MB) | Indeo 5.1 (22 MB) | Another version (5 MB) |
Our framework stores various characteristics about the average distribution of the set of polygons with each node in a BV hierarchy, taking only minimal additional memory footprint and construction time. We call such augmented BV hierarchies average-distribution tree or ADB-trees.
We have implemented our new approach by augmenting AABB trees and present performance measurements and comparisons with a very fast previous algorithm, namely the DOP-tree. The results show a speedup of about a factor 3 to 6 with only approximately 4% error.
@INPROCEEDINGS{Zach03d
, author = "Jan Klein and Gabriel Zachmann"
, title = "ADB-Trees: Controlling the Error of Time-Critical Collision
Detection"
, booktitle = "8th International Fall Workshop Vision, Modeling, and
Visualization (VMV)"
, year = 2003
, month = nov # "19--21"
, address = "University M{\"u}nchen, Germany"
, isbn = "1-58603-393-X"
, url = "http://www.gabrielzachmann.org/"
}