2018/07/25 by Shang Xiang, Xiang, Shang, Jianfei Liu +1
Computer Science · Engineering · #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #FOS: Computer and information sciences #Optimization and Packing Problems #Robotic Path Planning Algorithms
paper · pdf · doi:10.48550/arxiv.1807.09415
openalex publication_date 2018/07/25 · openalex created_date 2018/08/03 · openalex updated_date 2026/07/28
In this paper, we present a solution that uses the least number of hexahedra to build a pyramid, which is the key block required for one type of automatic hex-meshing method to be successful. When the initial result of a hex-meshing program is not appropriate for specific applications, some templates are used for revision. The templates reported thus far are parity-preserving, which means that the parity of the number of hexahedra in a mesh is unchanged after a revision following the templates. We present a parity-changing template that makes the template set integral and more effective. These two findings are obtained by a program that we developed for this study, which is a tool for researchers to observe the characteristics of small hexahedral packings.