scholarly journals A modification of the hexahedral mesh generator based on voxel geometry representation

Author(s):  
A.S. Karavaev ◽  
S.P. Kopysov

We consider a modification of the previously developed voxel-based mesh algorithm to generate models given in STL-geometry format. Proposed hexahedral mesh generator belongs to the family of grid methods, and is general-purpose in terms of a capability to use as source data both volume (voxel) and STL-surface representation of model geometry. For now, the algorithm works with CAD models described in the well-known STL format. However, it also allows to handle higher-order surface patches defined in an arbitrary format if appropriate procedures for projection and intersection operations will be specified. To define the initial position of mesh nodes, a “signed distance field” volume data file, obtained from the STL-geometry, is used. A special projection technique was developed to adapt constructed orthogonal mesh on the model's boundary. It provides an approximation of sharp edges and corners and is performed before running any other operations with the mesh. Finally, to improve the quality of the mesh, additional procedures were implemented, including boundary layers insertion, bad quality cells splitting, and optimization-based smoothing technique. The algorithm has been tested on a sufficient number of models, some of which are given as examples.

Author(s):  
H. James de St. Germain ◽  
David E. Johnson ◽  
Elaine Cohen

Reverse engineering (RE) is the process of defining and instantiating a model based on the measurements taken from an exemplar object. Traditional RE is costly, requiring extensive time from a domain expert using calipers and/or coordinate measurement machines to create new design drawings/CAD models. Increasingly RE is becoming more automated via the use of mechanized sensing devices and general purpose surface fitting software. This work demonstrates the ability to reverse-engineer parts by combining feature-based techniques with freeform surface fitting to produce more accurate and appropriate CAD models than previously possible.


2015 ◽  
Vol 32 (1) ◽  
pp. 129-154
Author(s):  
Ruding Lou ◽  
Jean-Philippe Pernot ◽  
Franca Giannini ◽  
Philippe Veron ◽  
Bianca Falcidieno

Purpose – The purpose of this paper is to set up a new framework to enable direct modifications of volume meshes enriched with semantic information associated to multiple partitions. An instance of filleting operator is prototyped under this framework and presented in the paper. Design/methodology/approach – In this paper, a generic mesh modification operator has been designed and a new instance of this operator for filleting finite element (FE) sharp edges of tetrahedral multi-partitioned meshes is also pro-posed. The filleting operator works in two main steps. The outer skin of the tetrahedral mesh is first deformed to round user-specified sharp edges while satisfying constraints relative to the shape of the so-called Virtual Group Boundaries. Then, in the filleting area, the positions of the inner nodes are relaxed to improve the aspect ratio of the mesh elements. Findings – The classical mainstream methodology for product behaviour optimization involves the repetition of four steps: CAD modelling, meshing of CAD models, enrichment of models with FE simulation semantics and FEA. This paper highlights how this methodology could be simplified by two steps: simulation model modification and FEA. The authors set up a new framework to enable direct modifications of volume meshes enriched with semantic information associated to multiple partitions and the corresponding fillet operator is devised. Research limitations/implications – The proposed framework shows only a paradigm of direct modifications of semantic enriched meshes. It could be further more improved by adding or changing the modules inside. The fillet operator does not take into account the exact radius imposed by user. With this proposed fillet operator the mesh element density may not be enough high to obtain wished smoothness. Originality/value – This paper fulfils an identified industry need to speed up the product behaviour analysis process by directly modifying the simulation semantic enriched meshes.


2015 ◽  
Vol 781 ◽  
pp. 568-571 ◽  
Author(s):  
Sanun Srisuk ◽  
Wachirapong Kesjindatanawaj ◽  
Surachai Ongkittikul

In this paper, we present a technique for accelerating the bilateral filtering using GPGPU. Bilateral filtering is a tool for an image smoothing with edge preserving properties. It serves as a mixture of domain and range filters. Domain filter suppresses Gaussian noise while range filter maintains sharp edges. Bilateral filtering is a nonlinear filtering in which the filter kernel must be computed pixel by pixel. Therefore conventional fast Fourier transform technique cannot be used to accelerate the bilateral filtering. Instead, general purpose GPU is used as a parallel machine to reduce time consuming of the bilateral filtering. We will show the experimental results by comparing the computation time of CPU and GPU. It was cleared that, from the experimental results, GPU outperformed the CPU in terms of computation time.


Author(s):  
Muting Hao ◽  
Feng Wang ◽  
Joshua Hope-Collins ◽  
Max E. Rife ◽  
Luca di Mare

Abstract This paper describes a multiblock grid generation method for turbine cooling geometries. The method is based on the observation that cooling films are essentially branches inserted on a large trunk, represented by the passage or by the cooling duct. The small size of the films compared to the overall size of turbine blades allows simplifications to be introduced with respect to general-purpose trunk and branch algorithms. The grid generation starts from an existing layout for the passage or cooling duct grid and operates on a Cartesian patch of the trunk surface. The patch is hollowed and a templated branch layout is inserted. Padding blocks are created to connect the two layouts into a single, boundary conforming layout. The resulting multiblock grid is then smoothed using a modification of Thompson’s Poisson system. The boundary mesh distribution is not prescribed. Instead, boundary orthogonality is enforced and elliptic smoothing is performed on the boundaries as well as inside the volume. The grid size control relies on a novel Newton-like update for the control functions of the Poisson system. The smoothing step is essential in achieving good grid quality throughout and determines, in part, the template for a given configuration. The algorithm is particularly suitable for large arrays of films or other cooling decoration and results show that the proposed method can produce grids of better quality than existing methods.


2010 ◽  
Vol 670 ◽  
pp. 318-324 ◽  
Author(s):  
Y. Motooka ◽  
So Noguchi ◽  
H. Igarashi

We have previously proposed an automatic hexahedral mesh generator. It is necessary to understand about the quality and characteristic of the generated mesh to perform hexahedral edge finite element analysis in electromagnetic. Therefore, we have compared high-quality meshes with poor-quality meshes, and investigated about the factors that affect the accuracy and the computation time. In addition, we investigated about the effect of the templates used in the proposed method. We will conclusively apply the result to improving the automatic hexahedral mesh generator.


1979 ◽  
Vol 1 (3) ◽  
pp. 131-136 ◽  
Author(s):  
A.J.G. Schoofs ◽  
L.H.Th.M. Van Beukering ◽  
M.L.C. Sluiter

2012 ◽  
Vol 45 (3) ◽  
pp. 309-328 ◽  
Author(s):  
Cameron Talischi ◽  
Glaucio H. Paulino ◽  
Anderson Pereira ◽  
Ivan F. M. Menezes

Sign in / Sign up

Export Citation Format

Share Document