Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Geometry design using function representation on a sparse hierarchical data structure

Kambampati, Sandilya, Jauregui, Carolina, Museth, Ken and Kim, H. Alicia ORCID: 2021. Geometry design using function representation on a sparse hierarchical data structure. Computer-Aided Design 133 , 102989. 10.1016/j.cad.2020.102989

Full text not available from this repository.


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.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Engineering
Publisher: Elsevier
ISSN: 0010-4485
Date of Acceptance: 17 December 2020
Last Modified: 09 Nov 2022 09:59

Citation Data

Cited 1 time in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item