G. Zachmann. The BoxTree: Exact and Fast Collision Detection of Arbitrary Polyhedra SIVE'95, University of Iowa, July 1995  Home/Search   Document Details and Download   Summary   Related Articles

....the sets associated with children of node is a subset of the set assigned to node . According to this definition, though, it would not be possible to limit the size of the hierarchy, since any primitive object could be assigned to multiple nodes. This kind of definition was used for instance in [Za 95]. 3.1 Building BV trees Most methods for building BV trees use either bottom up or topdown approach to construct them. Bottom up approach starts with the input primitives as the leafs of the tree and tries to group some of them together to form a node on level higher in the hierarchy, until it ....

....the hyperplane is apparent. Objects that are completely on the left are put into one part and objects that are completely on the right are put into the other. The methods differ in handling objects that intersect the hyperplane. Here the optimization criteria described above are often employed [Za 95]. The hyperplane is usually chosen in two steps. In the first step the algorithm chooses axis orthogonal to the hyperplane. In the second step the hyperplane is positioned according to some optimization criteria. 3.2.1 Choice of Axis The choice of axis often depends on particular bounding ....

[Article contains additional citation context not shown here]

G. Zachmann. The BoxTree: Exact and Fast Collision Detection of Arbitrary Polyhedra SIVE'95, University of Iowa, July 1995

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC