Efficient BVH Construction via Approximate Agglomerative Clustering
Loading...
Date
2013
Journal Title
Journal ISSN
Volume Title
Publisher
ACM
Abstract
We introduce Approximate Agglomerative Clustering (AAC), an efficient, easily parallelizable algorithm for generating high-quality bounding volume hierarchies using agglomerative clustering. The main idea of AAC is to compute an approximation to the true greedy agglomerative clustering solution by restricting the set of candidates inspected when identifying neighboring geometry in the scene. The result is a simple algorithm that often produces higher quality hierarchies (in terms of subsequent ray tracing cost) than a full sweep SAH build yet executes in less time than the widely used top-down, approximate SAH build algorithm based on binning.
Description
@inproceedings{10.1145:2492045.2492054,
booktitle = {Eurographics/ ACM SIGGRAPH Symposium on High Performance Graphics},
editor = {Kayvon Fatahalian and Christian Theobalt},
title = {{Efficient BVH Construction via Approximate Agglomerative Clustering}},
author = {Gu, Yan and He, Yong and Fatahalian, Kayvon and Blelloch, Guy},
year = {2013},
publisher = {ACM},
ISSN = {2079-8687},
ISBN = {978-1-4503-2135-8},
DOI = {10.1145/2492045.2492054}
}