BOXTREE: A Hierarchical Representation for Surfaces in 3D
View/
Date
1996Pay-Per-View via TIB Hannover:
Try if this item/paper is available.
Metadata
Show full item recordAbstract
We introduce the boxtree, a versatile data structure for representing triangulated or meshed surfaces in 3D. A boxtree is a hierarchical structure of nested boxes that supports efficient ray tracing and collision detection. It is simple and robust, and requires minimal space. In situations where storage is at a premium, boxtrees are effective alternatives to octrees and BSP trees. They are also more flexible and efficient than R-trees, and nearly as simple to implement.
BibTeX
@article {10.1111:1467-8659.1530387,
journal = {Computer Graphics Forum},
title = {{BOXTREE: A Hierarchical Representation for Surfaces in 3D}},
author = {Barequet, Gill and Chazelle, Bernard and Guibas, Leonidas J. and Mitchell, Joseph S.B. and Tal, Ayellet},
year = {1996},
publisher = {Blackwell Science Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.1530387}
}
journal = {Computer Graphics Forum},
title = {{BOXTREE: A Hierarchical Representation for Surfaces in 3D}},
author = {Barequet, Gill and Chazelle, Bernard and Guibas, Leonidas J. and Mitchell, Joseph S.B. and Tal, Ayellet},
year = {1996},
publisher = {Blackwell Science Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.1530387}
}