Title
Ellipsoid-tree construction for solid objects
Abstract
As ellipsoids have been employed in the collision handling of many applications in physical simulation and robotics systems, we present a novel algorithm for generating a bounding volume hierarchy (BVH) from a given model with ellipsoids as primitives. Our algorithm approximates the given model by a hierarchical set of optimized bounding ellipsoids. The ellipsoid-tree is constructed by a top-down splitting. Starting from the root of hierarchy, the volume occupied by a given model is divided into k sub-volumes where each is approximated by a volume bounding ellipsoid. Recursively, each sub-volume is then subdivided into ellipsoids for the next level in the hierarchy. The k ellipsoids at each hierarchy level for a sub-volume bounding is generated by a bottom-up algorithm - simply, the sub-volume is initially approximated by m spheres (m » k), which will be iteratively merged into k volume bounding ellipsoids and globally optimized to minimize the approximation error. Benefited from the anisotropic shape of primitives, the ellipsoid-tree constructed in our approach gives tighter volume bound and higher shape fidelity than another widely used BVH, sphere-tree.
Year
DOI
Venue
2007
10.1145/1236246.1236289
Symposium on Solid and Physical Modeling
Keywords
Field
DocType
anisotropic shape,volume hierarchy,tighter volume,ellipsoid-tree construction,k sub-volumes,higher shape fidelity,bottom-up algorithm,novel algorithm,k ellipsoids,solid object,hierarchy level,k volume,global optimization,top down,approximation error,bounding volume hierarchy,bottom up,solid modeling
Bounding volume hierarchy,Minimum bounding box algorithms,Mathematical optimization,Ellipsoid,Bounding volume,Hierarchy,Approximation error,Bounding interval hierarchy,Mathematics,Bounding overwatch
Conference
Citations 
PageRank 
References 
10
0.51
14
Authors
5
Name
Order
Citations
PageRank
Shengjun Liu111613.79
Charlie C. L. Wang2100.51
k c hui315318.70
Xiaogang Jin41075117.02
Hanli Zhao516017.20