You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Bounding Volume Hierarchies of Slab Cut Balls

Fulltext:


Authors:

Thomas Larsson, Tomas Akenine-Möller

Publication Type:

Report - MRTC

ISRN:

MDH-MRTC-231/2008-1-SE


Abstract

We introduce a bounding volume hierarchy based on the Slab Cut Ball} This novel type of enclosing volume provides an attractive balance between tightness of fit, cost of overlap testing, and memory requirement. The hierarchy construction algorithm includes a new method for the construction of tight bounding volumes in worst case O(n) time, which means our tree data structure is constructed in O(n log n) time using traditional top-down building methods. A fast overlap test method between two slab cut balls is also proposed, requiring as few as 28-99 arithmetic operations, including the transformation cost. Practical collision detection experiments confirm that our tree data structure is amenable for high performance collision queries. For example, in all the tested benchmarks, our bounding volume hierarchy consistently gives performance improvements over both the sphere tree and the OBB tree data structure. In particular, our method is asymptotically faster than the sphere tree, and it also outperforms the OBB tree, in close proximity situations.

Bibtex

@techreport{Larsson1281,
author = {Thomas Larsson and Tomas Akenine-M{\"o}ller},
title = {Bounding Volume Hierarchies of Slab Cut Balls},
number = {ISSN 1404-3041 ISRN MDH-MRTC-231/2008-1-SE},
month = {June},
year = {2008},
url = {http://www.es.mdu.se/publications/1281-}
}