.png){kind=icon}
返回
Geometry Design Using Function Representation on a Sparse Hierarchical Data Structure
.png){kind=icon}
OA
AI
DOI：10.1016/j.cad.2020.102989.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this study, we introduce new algorithms for efficient function representation (F-rep) based geometric design using the sparse and dynamic voxel data structure Volumetric Dynamic B+ tree (VDB). The level set method is used as the F-rep method. Specifically, we develop the Fast Sweeping Method for boundary points to level set surfaces velocity extension for efficient geometry optimization on such sparse and dynamic data structures. For benchmarking, we developed a level set method in-house, using state of the art algorithms on a dense data structure, which we use as a reference. OpenVDB, which is an open source library, is used to store and modify the sparse and dynamic voxel data. Our results show that the developed method is up to an order of magnitude faster than the reference method, while only consuming a small fraction of the memory. Finally, we apply the level set method using the sparse and dynamic data structure for lattice infill designs, where we show that the sparse F-rep geometry file is more than an order of magnitude smaller in size than a conventional boundary representation (B-rep) formats such as a stereolithography (STL) file. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
function representation
sparse grids
optimization
VDB
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.1
论文数:
3.1K
被引数:
6.4K
机构
引用论文
Introducing the sequential linear programming level-set method for topology optimization引入用于拓扑优化的顺序线性规划水平集方法OAAI
.png){kind=icon}
OAAI分享收藏分享收藏Level set based topological shape optimization of geometrically nonlinear structures using unstructured mesh基于水平集的基于非结构网格的几何非线性结构拓扑形状优化
PREAI
分享收藏分享收藏
查看更多内容