Construction of Bounding Volume Hierarchies for Triangle Meshes with Mixed Face Sizes

被引:0
|
作者
Li, Yi [1 ]
Shellshear, Evan [1 ]
Bohlin, Robert [1 ]
Carlson, Johan S. [1 ]
机构
[1] Fraunhofer Chalmers Ctr Ind Math, Geometry & Mot Planning Dept, SE-41288 Gothenburg, Sweden
关键词
D O I
10.1109/icra40945.2020.9197113
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider the problem of creating tighter-fitting bounding volumes (more specifically rectangular swept spheres) when constructing bounding volume hierarchies (BVHs) for complex 3D geometries given in the form of unstructured triangle meshes/soups with the aim of speeding up our IPS Path Planner for rigid bodies, where the triangles often have very different sizes. Currently, the underlying collision and distance computation module (IPS CDC) does not take into account the sizes of the triangles when it constructs BVHs using a topdown strategy. To split triangles in a BVH node into two BVH nodes, IPS CDC has to compute both the split axis and the split position. In this work, we use the principal axes of the tensor of inertia as the potential split axes and the center of mass as the split position, where the computations of both the tensor of inertia and the center of mass require knowledge of the areas of the triangles. We show that our method improves performance (up to 20% faster) of our IPS Path Planner when it is used to plan collision-free disassembly paths for three different test cases taken from manufacturing industries.
引用
收藏
页码:9191 / 9195
页数:5
相关论文
共 50 条
  • [1] Constructing hierarchies for triangle meshes
    Gieng, TS
    Hamann, B
    Joy, KI
    Schussman, GL
    Trotts, IJ
    [J]. IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 1998, 4 (02) : 145 - 161
  • [2] Chunked Bounding Volume Hierarchies for Fast Digital Prototyping Using Volumetric Meshes
    Schmidtke, Robert
    Erleben, Kenny
    [J]. IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2018, 24 (12) : 3044 - 3057
  • [3] Multiresolution hierarchies on unstructured triangle meshes
    Kobbelt, L
    Vorsatz, J
    Seidel, HP
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1999, 14 (1-3): : 5 - 24
  • [4] Fast Hardware Construction and Refitting of Quantized Bounding Volume Hierarchies
    Viitanen, T.
    Koskela, M.
    Jaaskelainen, P.
    Immonen, K.
    Takala, J.
    [J]. COMPUTER GRAPHICS FORUM, 2017, 36 (04) : 167 - 178
  • [5] On fast construction of SAH-based bounding volume hierarchies
    Wald, Ingo
    [J]. RT07: IEEE/EG SYMPOSIUM ON INTERACTIVE RAY TRACING 2007, 2007, : 33 - 40
  • [6] Multi Bounding Volume Hierarchies
    Ernst, Manfred
    Greiner, Guenther
    [J]. RT08: IEEE/EG SYMPOSIUM ON INTERACTIVE RAY TRACING 2008, PROCEEDINGS, 2008, : 35 - 40
  • [7] Hardware Architecture Design and Implementation of Ray-Triangle Intersection with Bounding Volume Hierarchies
    Chang, Chen-Haur
    Lee, Chuan-Yiu
    Chien, Shao-Yi
    [J]. RT08: IEEE/EG SYMPOSIUM ON INTERACTIVE RAY TRACING 2008, PROCEEDINGS, 2008, : 179 - 179
  • [8] Rasterized Bounding Volume Hierarchies
    Novak, Jan
    Dachsbacher, Carsten
    [J]. COMPUTER GRAPHICS FORUM, 2012, 31 (02) : 403 - 412
  • [9] Efficient construction of bounding volume hierarchies into a complete octree for ray tracing
    Olivares, Ulises
    Rodriguez, Hector G.
    Garcia, Arturo
    Ramos, Felix F.
    [J]. COMPUTER ANIMATION AND VIRTUAL WORLDS, 2016, 27 (3-4) : 358 - 368
  • [10] Construction of bounding volume hierarchies with SAH cost approximation on temporary subtrees
    Wodniok, Dominik
    Goesele, Michael
    [J]. COMPUTERS & GRAPHICS-UK, 2017, 62 : 41 - 52