Relevant bibliographies by topics / Hexahedral

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Hexahedral'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Hexahedral.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Hexahedral"

1

Bai, Xin Li, Bing Ma, and Jiang Yan Li. "A Practical Technique for Generating Hexahedral Meshes." Applied Mechanics and Materials 238 (November 2012): 214–17. http://dx.doi.org/10.4028/www.scientific.net/amm.238.214.

Full text
Abstract:
A practical technique for generating hexahedral meshes automatically is proposed in this paper. The technique is accomplished by secondary subdivision of a tetrahedron. The implementation method from tetrahedron to hexahedron through secondary subdivision is discussed. The method and treatment of boundary condition formula are derived, and the simple and practical load processing method is given. Finally a tetrahedron-based hexahedron automatic meshing program is developed. Engineering examples shows that the calculation accuracy of the method is comparatively high. The proposed method can be applied to any entity.
APA, Harvard, Vancouver, ISO, and other styles
2

Staten, Matthew L., Jason F. Shepherd, Franck Ledoux, and Kenji Shimada. "Hexahedral Mesh Matching: Converting non-conforming hexahedral-to-hexahedral interfaces into conforming interfaces." International Journal for Numerical Methods in Engineering 82, no. 12 (December 3, 2009): 1475–509. http://dx.doi.org/10.1002/nme.2800.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gheni, Mamtimin, X. F. Wang, and Masanori Kikuchi. "Study on Self-Consistent Mesh Generating Method of Hexahedron Element Based on the Local Waveform Method with Damping." Key Engineering Materials 306-308 (March 2006): 607–12. http://dx.doi.org/10.4028/www.scientific.net/kem.306-308.607.

Full text
Abstract:
Three-dimensional finite element method (FEM) is widely used as an effective numerical simulation technique to solve the complex engineering problem. In the FEM simulation technique at first it needs to discrete the problem. However, the almost all of the engineering problem have very complicated structure and shape, so that the mesh generation also have much difficulty. Furthermore, the correct generation of mesh is one of the most significant issues that directly affect to the accuracy of the FEM simulation. Though in extensive commercial software have an excellent automatic mesh generating system, however the problem of hexahedral automatic mesh generation and its adaptation are not enough to solve for practical applications, because for the mesh generation of complex shape is very difficult and still intensive labor work by hand. In this paper we present a new method to generate an appropriate mesh using existing regular hexahedral mesh and hexahedron mesh generation technique. This technique based on the wave transmits theory with damp named Waveform Mesh Generating (WMG) method. The results shown that the complex shaped FEM discrete hexahedral mesh model generated when shape of the side apply to regular mesh side as a waveform constraint.
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Xu Fei, Mamtimin Gheni, Masanori Kikuchi, and Ju Rong Liu. "Study on Complex Structure Mesh Generating of Hexahedron Element Based on Improved Waveform Mesh Generating Method." Key Engineering Materials 462-463 (January 2011): 955–60. http://dx.doi.org/10.4028/www.scientific.net/kem.462-463.955.

Full text
Abstract:
Three-dimensional finite element method (FEM) is widely used as an effective numerical simulation technique to solve the complex engineering problem. Usually, the more complex engineering problem has more complex structure and shape; the FEM simulation technique is that needs to discrete the structure and shape of the problem by mesh. In addition, the correct generation of mesh is one of the most significant issues that directly affect to the accuracy of the FEM simulation. The hexahedral mesh is better than tetrahedral mesh in solving the complex engineering problem. The common methods of hexahedral automatic mesh generation have been used in some commercial soft already, but its adaptation is not enough to solve for practical applications of the complex engineering problems. A new method of mesh generation technique was proposed by improved waveform mesh generating method, and realized by C++ developing program in Linux OS. The method could generate some effective and smoothly mesh models by quadrilateral element or hexahedron element, and not only generated revolution curve surface meshes, but also generated random meshes according to free functions too. The results shown that the hexahedral mesh models of the complex shapes were generated as the shape function apply to regular mesh side as a waveform constraint.
APA, Harvard, Vancouver, ISO, and other styles
5

Islam, Md Shahidul, and Gazi Md Khalil. "MODIFICATION OF SURFACE MESH FOR THE GENERATION OF KNIFE ELEMENT FREE HEXAHEDRAL MESH." Journal of Mechanical Engineering 41, no. 2 (April 16, 2011): 103–13. http://dx.doi.org/10.3329/jme.v41i2.7505.

Full text
Abstract:
Hexahedral elements provide greater accuracy and efficiency over tetrahedral elements for finite element analysis of solids and for this reason the all-hexahedral element auto meshing has a growing demand. The whisker-weaving based plastering algorithm developed by the authors can generate hexahedral mesh (HM) automatically. In this method the prerequisite for generating HM is quadrilateral surface mesh (SM). From the given SM, combinatorial dual cycles or whisker sheet loops for whisker weaving algorithm are generated to produce HM. Generation of good quality HM does not depend only on the quality of quadrilaterals of the SM but also on the quality of the dual cycles generated from it. If the dual cycles have self-intersection, it could cause the formation of degenerated hexahedron called knife element, which is not usable in finite element analysis. In this paper a detailed method is proposed to modify the SM to remove self-intersections from its dual loops. The SM modification procedure of this proposed method has three basic steps. These steps are (a) face collapsing, (b) new face generation and (c) template application. A fully automatic computer program is developed on the basis of this proposed method and a number of models are analyzed to show the effectiveness of the proposal.DOI: http://dx.doi.org/10.3329/jme.v41i2.7505
APA, Harvard, Vancouver, ISO, and other styles
6

Sokolov, Dmitry, Nicolas Ray, Lionel Untereiner, and Bruno Lévy. "Hexahedral-Dominant Meshing." ACM Transactions on Graphics 35, no. 5 (September 22, 2016): 1–23. http://dx.doi.org/10.1145/2930662.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sokolov, Dmitry, Nicolas Ray, Lionel Untereiner, and Bruno Lévy. "Hexahedral-Dominant Meshing." ACM Transactions on Graphics 36, no. 4 (July 20, 2017): 1. http://dx.doi.org/10.1145/3072959.2930662.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sokolov, Dmitry, Nicolas Ray, Lionel Untereiner, and Bruno Lévy. "Hexahedral-dominant meshing." ACM Transactions on Graphics 36, no. 4 (July 20, 2017): 1. http://dx.doi.org/10.1145/3072959.3126827.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

EGOROVA, Olga, Maria SAVCHENKO, Vladimir SAVCHENKO, and Ichiro HAGIWARA. "Topology and Geometry of Hexahedral Complex: Combined Approach for Hexahedral Meshing." Journal of Computational Science and Technology 3, no. 1 (2009): 171–82. http://dx.doi.org/10.1299/jcst.3.171.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bremberg, Daniel, and Guido Dhondt. "Automatic Mixed-Mode Crack Propagation based on a Combined Hexahedral-Tetrahedral Approach." Key Engineering Materials 348-349 (September 2007): 581–84. http://dx.doi.org/10.4028/www.scientific.net/kem.348-349.581.

Full text
Abstract:
In the present paper, a new method for inserting cracks with out-of-plane features is presented. Starting point is an arbitrary reference structure and a crack of any shape. The final cracked structure is represented by hexahedral elements in the crack-front region and tetrahedral elements in the remaining structure domain. The tetrahedron is employed to take advantage of the versatile meshing capabilities and the collapsed quarter-point hexahedron gives good crack-tip behaviour. Stress intensity factors are calculated from the asymptotic stress field, retrieved from the integration points near the crack-tip.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Hexahedral"

1

MIRANDA, FABIO MARKUS NUNES. "VOLUME RENDERING OF UNSTRUCTURED HEXAHEDRAL MESHES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2011. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=28921@1.

Full text
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
PROGRAMA DE EXCELENCIA ACADEMICA
Importantes aplicações de engenharia usam malhas não estruturadas de hexaedros para simulações numéricas. Células hexaédricas, comparadas com tetraedros, tendem a ser mais numericamente estáveis e requerem um menor refinamento da malha. Entretando, visualização volumétrica de malhas não estruturadas é um desafio devido a variação trilinear do campo escalar dentro da célula. A solução convencional consiste em subdividir cada hexaedro em cinco ou seis tetraedros, aproximando uma variação trilinear por uma inadequada série de funções lineares. Isso resulta em imagens inadequadas e aumenta o consumo de memória. Nesta tese, apresentamos um algoritmo preciso de visualização volumétrica utilizando ray-casting para malhas não estruturadas de hexaedros. Para capturar a variação trilinear ao longo do raio, nós propomos usar uma integração de quadratura. Nós também propomos uma alternativa rápida que melhor aproxima a variação trilinear, considerando os pontos de mínimo e máximo da função escalar ao longo do raio. Uma série de experimentos computacionais demonstram que nossa proposta produz resultados exatos, com um menor gasto de memória. Todo algoritmo é implementado em placas gráficas, garantindo uma performance competitiva.
Important engineering applications use unstructured hexahedral meshes for numerical simulations. Hexahedral cells, when compared to tetrahedral ones, tend to be more numerically stable and to require less mesh refinement. However, volume visualization of unstructured hexahedral meshes is challenging due to the trilinear variation of scalar fields inside the cells. The conventional solution consists in subdividing each hexahedral cell into five or six tetrahedra, approximating a trilinear variation by an inadequate piecewise linear function. This results in inaccurate images and increases the memory consumption. In this thesis, we present an accurate ray-casting volume rendering algorithm for unstructured hexahedral meshes. In order to capture the trilinear variation along the ray, we propose the use of quadrature integration. We also propose a fast approach that better approximates the trilinear variation to a series of linear ones, considering the points of minimum and maximum of the scalar function along the ray. A set of computational experiments demonstrates that our proposal produces accurate results, with reduced memory footprint. The entire algorithm is implemented on graphics cards, ensuring competitive performance.
APA, Harvard, Vancouver, ISO, and other styles
2

Price, Mark A. "Hexahedral mesh generation by medial surface subdivision." Thesis, Queen's University Belfast, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286777.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Woodbury, Adam C. "Localized Coarsening of Conforming All-Hexahedral Meshes." Diss., CLICK HERE for online access, 2008. http://contentdm.lib.byu.edu/ETD/image/etd2578.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Roca, Navarro Xevi. "Paving the path towards automatic hexahedral mesh generation." Doctoral thesis, Universitat Politècnica de Catalunya, 2009. http://hdl.handle.net/10803/5858.

Full text
Abstract:
Esta tesis versa sobre el desarrollo de las tecnologías para la generación de mallas de hexaedros. El proceso de generar una malla de hexaedros no es automático y su generación requiere varias horas te trabajo de un ingeniero especializado. Por lo tanto, es importante desarrollar herramientas que faciliten dicho proceso de generación. Con este fin, se presenta y desarrolla un método de proyección de mallas, una técnica de sweeping o barrido, un algoritmo para la obtención de mallas por bloques, y un entorno de generación de mallas.

Las implementaciones más competitivas del método de sweeping utilizan técnicas de proyección de mallas basadas en métodos afines. Los métodos afines más habituales presentan varios problemas relacionados con la obtención de sistemas de ecuaciones normales de rango deficiente. Para solucionar dichos problemas se presenta y analiza un nuevo método afín que depende de dos parámetros vectoriales. Además, se detalla un procedimiento automático para la selección de dichos vectores. El método de proyección resultante preserva la forma de las mallas proyectadas. Esta proyección es incorporada también en una nueva herramienta de sweeping. Dicha herramienta genera capas de nodos internos que respetan la curvatura de las superficies inicial y final. La herramienta de sweeping es capaz de mallar geometrías de extrusión definidas por trayectorias curvas, secciones no constantes a lo largo del eje de sweeping, y superficies inicial y final con diferente forma y curvatura.

En las últimas décadas se han propuesto varios ataques para la generación automática de mallas de hexahedros. Sin embargo, todavía no existe un algoritmo rápido y robusto que genere automáticamente mallas de hexaedros de alta calidad. Se propone un nuevo ataque para la generación de mallas por bloques mediante la representación de la geometría y la topología del dual de una malla de hexaedros. En dicho ataque, primero se genera una malla grosera de tetraedros. Después, varió polígonos planos se añaden al interior de los elementos de la malla grosera inicial. Dichos polígonos se denotan como contribuciones duales locales y representan una versión discreta del dual de una malla de hexaedros. En el último paso, la malla por bloques se obtiene como el dual de la representación del dual generada. El algoritmo de generación de mallas por bloques es aplicado a geometrías que presentan diferentes características geométricas como son superficies planas, superficies curvas, configuraciones delgadas, agujeros, y vértices con valencia mayor que tres.

Las mallas se generan habitualmente con la ayuda de entornos interactivos que integran una interfaz CAD y varios algoritmos de generación de mallas. Se presenta un nuevo entorno de generación de mallas especializado en la generación de cuadriláteros y hexaedros. Este entorno proporciona la tecnología necesaria para implementar les técnicas de generación de mallas de hexaedros presentadas en esta tesis.
This thesis deals with the development of hexahedral mesh generation technology. The process of generating hexahedral meshes is not fully automatic and it is a time consuming task. Therefore, it is important to develop tools that facilitate the generation of hexahedral meshes. To this end, a mesh projection method, a sweeping technique, a block-meshing algorithm, and an interactive mesh generation environment are presented and developed.

Competitive implementations of the sweeping method use mesh projection techniques based on affine methods. Standard affine methods have several drawbacks related to the statement of rank deficient sets of normal equations. To overcome these drawbacks a new affine method that depends on two vector parameters is presented and analyzed. Moreover, an automatic procedure that selects these two vector parameters is detailed. The resulting projection procedure preserves the shape of projected meshes. Then, this procedure is incorporated in a new sweeping tool. This tool generates inner layers of nodes that preserve the curvature of the cap surfaces. The sweeping tool is able to mesh extrusion geometries defined by non-linear sweeping trajectories, non-constant cross sections along the sweep axis, non-parallel cap surfaces, and cap surfaces with different shape and curvature.

In the last decades, several general-purpose approaches to generate automatically hexahedral meshes have been proposed. However, a fast and robust algorithm that automatically generates high-quality hexahedral meshes is not available. A novel approach for block meshing by representing the geometry and the topology of a hexahedral mesh is presented. The block-meshing algorithm first generates an initial coarse mesh of tetrahedral elements. Second, several planar polygons are added inside the elements of the initial coarse mesh. These polygons are referred as local dual contributions and represent a discrete version of the dual of a hexahedral mesh. Finally, the dual representation is dualized to obtain the final block mesh. The block-meshing algorithm is applied to mesh geometries that present different geometrical characteristics such as planar surfaces, curved surfaces, thin configurations, holes, and vertices with valence greater than three.

Meshes are usually generated with the help of interactive environments that integrate a CAD interface and several meshing algorithms. An overview of a new mesh generation environment focused in quadrilateral and hexahedral mesh generation is presented. This environment provides the technology required to implement the hexahedral meshing techniques presented in this thesis.
APA, Harvard, Vancouver, ISO, and other styles
5

Paudel, Gaurab. "Hexahedral Mesh Refinement Using an Error Sizing Function." BYU ScholarsArchive, 2011. https://scholarsarchive.byu.edu/etd/3447.

Full text
Abstract:
The ability to effectively adapt a mesh is a very important feature of high fidelity finite element modeling. In a finite element analysis, a relatively high node density is desired in areas of the model where there are high error estimates from an initial analysis. Providing a higher node density in such areas improves the accuracy of the model and reduces the computational time compared to having a high node density over the entire model. Node densities can be determined for any model using the sizing functions based on the geometry of the model or the error estimates from the finite element analysis. Robust methods for mesh adaptation using sizing functions are available for refining triangular, tetrahedral, and quadrilateral elements. However, little work has been published for adaptively refining all hexahedral meshes using sizing functions. This thesis describes a new approach to drive hexahedral refinement based upon an error sizing function and a mechanism to compare the sizes of the node after refinement.
APA, Harvard, Vancouver, ISO, and other styles
6

Malone, J. Bruce. "Two-Refinement by Pillowing for Structured Hexahedral Meshes." BYU ScholarsArchive, 2012. https://scholarsarchive.byu.edu/etd/3495.

Full text
Abstract:
A number of methods for adaptation of existing all-hexahedral grids by localized refinement have been developed; however, none ideally fit all refinement needs. This thesis presents the structure to a method of two-refinement developed for conformal, structured, all-hexahedral grids that offers flexibility beyond what has been offered to date. The method is fundamentally based on pillowing pairs of sheets of hexes. This thesis also suggests an implementation of the method, shows the results of examples refined using it and compares these results to results from implementing three-refinement on the same examples.
APA, Harvard, Vancouver, ISO, and other styles
7

Harris, Nathan. "Conformal Refinement of All-Hexahedral Finite Element Meshes." BYU ScholarsArchive, 2004. https://scholarsarchive.byu.edu/etd/3461.

Full text
Abstract:
Mesh adaptation techniques are used to modify complex finite element meshes to reduce analysis time and improve accuracy. Modification of all-hexahedral meshes has proven difficult to the unique connectivity constraints they exhibit. This thesis presents an automated tool for local, conformal refinement of all-hexahedral meshes based on the insertion of multi-directional twist planes into the spatial twist continuum. The contributions of this thesis are (1) the ability to conformally refine all entities of an all-hexahedral element mesh, (2) the simplification of template insertion to multi-directional refinement. The refinement algorithm is divided into single hex sheet operations, where individual refinement steps are performed completely within a single hex sheet, and parallel sheet operation, where each refinement step occurs within two parallel hex sheets. Combining these two procedures facilitates the refinement of any mesh feature. Refinement is accomplished by replacing original mesh elements with one or more of six base templates selected by the number of nodes, flagged for refinement on the element. The refinement procedures are covered in detail with representative graphics and examples that illustrate the application of the techniques and the results of the refinement.
APA, Harvard, Vancouver, ISO, and other styles
8

Özdemir, Hüseyin. "High-order discontinuous Galerkin method on hexahedral elements for aeroacoustics." Enschede : University of Twente [Host], 2006. http://doc.utwente.nl/57867.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Parrish, Michael H. "A selective approach to conformal refinement of unstructured hexahedral meshes /." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd1985.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Parrish, Michael Hubbard. "A Selective Approach to Hexahedral Refinement of Unstructured Conformal Meshes." BYU ScholarsArchive, 2007. https://scholarsarchive.byu.edu/etd/979.

Full text
Abstract:
Hexahedral refinement increases the density of an all-hexahedral mesh in a specified region, improving numerical accuracy. Previous research using solely sheet refinement theory made the implementation computationally expensive and unable to effectively handle multiply-connected transition elements and self-intersecting hexahedral sheets. The Selective Approach method is a new procedure that combines two diverse methodologies to create an efficient and robust algorithm able to handle the above stated problems. These two refinement methods are: 1) element by element refinement and 2) directional refinement. In element by element refinement, the three inherent directions of a hexahedron are refined in one step using one of seven templates. Because of its computational superiority over directional refinement, but its inability to handle multiply-connected transition elements, element by element refinement is used in all areas of the specified region except regions local to multiply-connected transition elements. The directional refinement scheme refines the three inherent directions of a hexahedron separately on a hexahedron by hexahedron basis. This differs from sheet refinement which refines hexahedra using hexahedral sheets. Directional refinement is able to correctly handle multiply-connected transition elements. A ranking system and propagation scheme allow directional refinement to work within the confines of the Selective Approach Algorithm.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Hexahedral"

1

Greenspan, Donald. Conservative motion of a discrete, nonsymmetric, hexahedral gyroscope. Arlington, Tex: University of Texas at Arlington, Dept. of Mathematics, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ananda, Himansu, Hultgren Lennart S, and NASA Glenn Research Center, eds. A 3-D CE/SE Navier-Stokes solver with unstructured hexahedral grid for computation of near field jet screech noise. [Cleveland, Ohio: NASA Glenn Research Center, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

A 3-D CE/SE Navier-Stokes solver with unstructured hexahedral grid for computation of near field jet screech noise. [Cleveland, Ohio: NASA Glenn Research Center, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ananda, Himansu, Hultgren Lennart S, and NASA Glenn Research Center, eds. A 3-D CE/SE Navier-Stokes solver with unstructured hexahedral grid for computation of near field jet screech noise. [Cleveland, Ohio: NASA Glenn Research Center, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ananda, Himansu, Hultgren Lennart S, and NASA Glenn Research Center, eds. A 3-D CE/SE Navier-Stokes solver with unstructured hexahedral grid for computation of near field jet screech noise. [Cleveland, Ohio: NASA Glenn Research Center, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Farris, Charles. The Hexahedron. Writers Club Press, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sukaneeyouth, Anan. Thirty-two nodes hexahedronal element subroutine for multi-purpose program MEF. 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Hexahedral"

1

Chen, Jinming, Hua Zhu, Shuming Gao, and Haiyan Wu. "An Improved Hexahedral Mesh Matching Algorithm." In Proceedings of the 22nd International Meshing Roundtable, 183–201. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-02335-9_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Guo, Sha, Ronggang Wang, Xiubao Jiang, Zhenyu Wang, and Wen Gao. "Parallax-Robust Hexahedral Panoramic Video Stitching." In Advances in Multimedia Information Processing – PCM 2017, 598–608. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-77380-3_57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ida, Nathan, and João P. A. Bastos. "Hexahedral Edge Elements — Some 3D Applications." In Electromagnetics and Calculation of Fields, 445–83. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-0661-3_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Karavaev, Alexander Sergeevich, and Sergey Petrovich Kopysov. "Hexahedral Mesh Generation Using Voxel Field Recovery." In Lecture Notes in Computational Science and Engineering, 295–305. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-76798-3_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dhondt, Guido. "Automatic 3-D Crack Propagation Calculations in Industrial Components: A Pure Hexahedral versus a Combined Hexahedral-Tetrahedral Approach." In Advances in Fracture and Damage Mechanics VI, 45–48. Stafa: Trans Tech Publications Ltd., 2007. http://dx.doi.org/10.4028/0-87849-448-0.45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cohen, Gary, and Sébastien Pernet. "Hexahedral and Quadrilateral Spectral Elements for Acoustic Waves." In Scientific Computation, 95–173. Dordrecht: Springer Netherlands, 2016. http://dx.doi.org/10.1007/978-94-017-7761-2_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sun, M., and K. Takayama. "A Solution-Adaptive Technique Using Unstructured Hexahedral Grids." In Computational Fluid Dynamics 2000, 55–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-56535-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gharbia, Ibtihel Ben, Jérôme Jaffré, N. Suresh Kumar, and Jean E. Roberts. "Benchmark 3D: A Composite Hexahedral Mixed Finite Element." In Finite Volumes for Complex Applications VI Problems & Perspectives, 969–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20671-9_94.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Shepherd, Jason F. "Conforming Hexahedral Mesh Generation via Geometric Capture Methods." In Proceedings of the 18th International Meshing Roundtable, 85–102. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04319-2_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mukherjee, Nilanjan, Bhanu Peddi, Jean Cabello, and Michael Hancock. "Automatic Hexahedral Sweep Mesh Generation of Open Volumes." In Proceedings of the 21st International Meshing Roundtable, 333–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-33573-0_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Hexahedral"

1

Chao, Pan, Liu Zhenyu, and Tan Jianrong. "Simplification of hexahedral mesh." In ACM SIGGRAPH 2012 Posters. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2342896.2343009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Eppstein, David. "Linear complexity hexahedral mesh generation." In the twelfth annual symposium. New York, New York, USA: ACM Press, 1996. http://dx.doi.org/10.1145/237218.237237.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lindstrom, Peter, and Martin Isenburg. "Lossless Compression of Hexahedral Meshes." In 2008 Data Compression Conference DCC. IEEE, 2008. http://dx.doi.org/10.1109/dcc.2008.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lu, Yong, Rajit Gadh, and Timothy J. Tautges. "Feature Decomposition for Hexahedral Meshing." In ASME 1999 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/detc99/dac-8618.

Full text
Abstract:
Abstract This paper presents a feature based volume decomposition approach for Hexahedral Mesh generation. In this approach, feature recognition techniques are introduced to determine decomposition features from a CAD model and the model is decomposed into sub-models, which become meshable or can be meshed by meshing algorithms in a computationally inexpensive manner. The feature recognition methods employed are convexity based and use topology and geometry information, which is generally available in BREP solid modelers. The procedure of feature decomposition is recursive: sub-models are further decomposed until either they are matched with appropriate meshing algorithms or no more decomposition features are detected. The code is designed and programmed for self-adaptation and error-tolerance to achieve high automation with complex geometry. The paper gives testing results for several complicated manufactured parts.
APA, Harvard, Vancouver, ISO, and other styles
5

Benzley, Steven, Ted D. Blacker, Scott A. Mitchell, Peter Murdoch, and Timothy J. Tautges. "Hexahedral mesh generation via the dual." In the eleventh annual symposium. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/220279.220323.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Matringe, Se´bastien F., Ruben Juanes, and Hamdi A. Tchelepi. "A New Mixed Finite Element and its Related Finite Volume Discretization on General Hexahedral Grids." In ASME 2008 International Mechanical Engineering Congress and Exposition. ASMEDC, 2008. http://dx.doi.org/10.1115/imece2008-68075.

Full text
Abstract:
Modern reservoir simulation grids are generally composed of distorted hexahedral elements populated with heterogeneous and possibly full-tensor coefficients. The numerical discretization of the reservoir flow equations on such grids is a challenging problem. Finite volume methods based on a two-point flux approximation (TPFA) do not properly account for grid distortion or permeability anisotropy that is misaligned with the grid. Multipoint flux approximation (MPFA) methods have been developed to overcome these shortcomings. Although implemented and used in virtually every commercial reservoir simulator, a proof of convergence for MPFA methods on three-dimensional hexahedral grids has remained elusive. Here, we present a link between MPFA and a new mixed finite element methods (MFEM) on hexahedral grids, which provides a powerful mathematical framework for the analysis of MPFA. First, we introduce a new mixed finite element on 3D hexahedra. The new element defines a velocity field with bilinear normal components through element faces. Thus, the new velocity field is defined by four degrees of freedom per face, which are the normal components of the velocity field at the vertices of each face. The new space is compatible with a piecewise constant pressure discretization and yields a convergent discretization. The application of a vertex-based quadrature rule reduces the new mixed finite element method to a multipoint flux control volume method. For Cartesian grids, this is in fact the classical MPFA O-method. This provides for the first time a direct link between MFEM and MPFA on hexahedral grids, which we use to establish convergence of MPFA for 3D rectangular grids.
APA, Harvard, Vancouver, ISO, and other styles
7

Hirsch, Charles, Andrey Wolkov, and Benoit Leonard. "Discontinuous Galerkin Method on Unstructured Hexahedral Grids." In 47th AIAA Aerospace Sciences Meeting including The New Horizons Forum and Aerospace Exposition. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2009. http://dx.doi.org/10.2514/6.2009-177.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yu, Wuyi, Kang Zhang, and Xin Li. "Recent algorithms on automatic hexahedral mesh generation." In 2015 10th International Conference on Computer Science & Education (ICCSE). IEEE, 2015. http://dx.doi.org/10.1109/iccse.2015.7250335.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Miranda, F´bio Markus, and Waldemar Celes. "Accurate Volume Rendering of Unstructured Hexahedral Meshes." In 2011 24th SIBGRAPI Conference on Graphics, Patterns and Images (Sibgrapi). IEEE, 2011. http://dx.doi.org/10.1109/sibgrapi.2011.3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shih, Bih-Yaw, and Hiroshi Sakurai. "Automatic Regular Hexahedral Mesh Generation by Regular Volume Decomposition." In ASME 1997 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/detc97/cie-4497.

Full text
Abstract:
Abstract A method has been developed to generate regular hexahedral meshes automatically from arbitrary solid models by volume decomposition. This method first decomposes a solid model having a complex shape into volumes having simple shapes. Then, shape-specific meshing methods like mapping are applied to generate regular hexahedral meshes from these volumes. Finally, all regular hexahedral meshes of these volumes are combined into a regular hexahedral mesh of the original solid model. Thus the method generates regular hexahedral meshes automatically in a way similar to the way a human does interactively. This is in contrast to the previous methods of automatic hexahedral mesh generation, which try to generate hexahedral meshes from solid models directly.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Hexahedral"

1

Owen, Steven, Corey Ernst, and Clinton Stimpson. Sculpt: Automatic Parallel Hexahedral Mesh Generation. Office of Scientific and Technical Information (OSTI), June 2019. http://dx.doi.org/10.2172/1762652.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Grandy, J. Efficient computation of volume of hexahedral cells. Office of Scientific and Technical Information (OSTI), October 1997. http://dx.doi.org/10.2172/632793.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

J. MOREL, J. MCGHEE, and ET AL. 3-D UNSTRUCTURED HEXAHEDRAL-MESH Sn TRANSPORT METHODS. Office of Scientific and Technical Information (OSTI), November 2000. http://dx.doi.org/10.2172/768173.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Naff, R. L., T. F. Russell, and J. D. Wilson. Shape Functions for Velocity Interpolation in General Hexahedral Cells. Fort Belvoir, VA: Defense Technical Information Center, January 2001. http://dx.doi.org/10.21236/ada453117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Staten, Matthew L., and Steven James Owen. Parallel octree-based hexahedral mesh generation for eulerian to lagrangian conversion. Office of Scientific and Technical Information (OSTI), September 2010. http://dx.doi.org/10.2172/1008123.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Evans, John A., and Thomas J. Hughes. Explicit Trace Inequalities for Isogeometric Analysis and Parametric Hexahedral Finite Elements. Fort Belvoir, VA: Defense Technical Information Center, May 2011. http://dx.doi.org/10.21236/ada555335.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Wenyan, Yongjie Zhang, Guoliang Xu, and Thomas J. Hughes. Converting an Unstructured Quadrilateral/Hexahedral Mesh to a Rational T-spline. Fort Belvoir, VA: Defense Technical Information Center, August 2011. http://dx.doi.org/10.21236/ada555343.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Leland, Robert W. Comparative Study of Hexahedral and Tetrahedral Elements for Non-linear Structural Analysis. Office of Scientific and Technical Information (OSTI), February 2000. http://dx.doi.org/10.2172/1331497.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Aftosmis, Michael J. Viscous Flow Simulation Using an Upwind Method for Hexahedral Based Adaptive Meshes. Fort Belvoir, VA: Defense Technical Information Center, March 1993. http://dx.doi.org/10.21236/ada265901.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Park, Byoung Yoon, and Barry L. Roberts. Construction of hexahedral elements mesh capturing realistic geometries of Bayou Choctaw SPR site. Office of Scientific and Technical Information (OSTI), September 2015. http://dx.doi.org/10.2172/1214248.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Hexahedral' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography