Efficient computation of volume of hexahedral cells

doi:https://doi.org/10.2172/632793

Title: Efficient computation of volume of hexahedral cells

Full Record
Other Related Research

Abstract

This report describes an efficient method to compute the volume of hexahedral cells used in three-dimensional hydrodynamics simulation. Two common methods for creating the hexahedron using triangular boundaries are considered.

Authors:: Grandy, J

Publication Date:: 1997-10-30

Research Org.:: Lawrence Livermore National Lab., CA (United States)

Sponsoring Org.:: USDOE, Washington, DC (United States)

OSTI Identifier:: 632793

Report Number(s):: UCRL-ID-128886
ON: DE98051032

DOE Contract Number:: W-7405-ENG-48

Resource Type:: Technical Report

Resource Relation:: Other Information: PBD: 30 Oct 1997

Country of Publication:: United States

Language:: English

Subject:: 40 CHEMISTRY; CRYSTAL STRUCTURE; LAGRANGIAN FUNCTION

Citation Formats


                    Grandy, J. Efficient computation of volume of hexahedral cells.  United States: N. p., 1997. 
        Web.  doi:10.2172/632793.

Copy to clipboard


                    Grandy, J. Efficient computation of volume of hexahedral cells.  United States.  https://doi.org/10.2172/632793

Copy to clipboard


                    Grandy, J. Thu .  
        "Efficient computation of volume of hexahedral cells".  United States.  https://doi.org/10.2172/632793.  https://www.osti.gov/servlets/purl/632793.

Copy to clipboard


                    
@article{osti_632793,

  title        = {Efficient computation of volume of hexahedral cells},

  author       = {Grandy, J},

  abstractNote = {This report describes an efficient method to compute the volume of hexahedral cells used in three-dimensional hydrodynamics simulation. Two common methods for creating the hexahedron using triangular boundaries are considered.},

  doi          = {10.2172/632793},

  url          = {https://www.osti.gov/biblio/632793},
  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {1997},

  month        = {10}

}

Copy to clipboard

Technical Report:

View Technical Report (0.18 MB)

https://doi.org/10.2172/632793

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Parallel computation of electromagnetic fields

Technical Report Madsen, N K

The DSI3D code is designed to numerically solve electromagnetics problems involving complex objects by solving Maxwell`s curl equations in the time-domain and in three space dimensions. The code has been designed to run on the new parallel processing computers as well as on conventional serial computers. The DSI3D code is unique for the following reasons: It runs efficiently on a variety of parallel computers, Allows the use of unstructured non-orthogonal grids, Allows a variety of cell or element types, Reduces to be the Finite Difference Time Domain (FDID) method when orthogonal grids are used, Preserves charge or divergence locally (andmore »« less
https://doi.org/10.2172/620998

Full Text Available
Efficient volume computation for three-dimensional hexahedral cells

Journal Article Dukowicz, J K - J. Comput. Phys.; (United States)

Currently, algorithms for computing the volume of hexahedral cells with ''ruled'' surfaces require a minimum of 122 FLOPs (floating point operations) per cell. A new algorithm is described which reduces the operation count to 57 FLOPs per cell. copyright 1988 Academic Press, Inc.
https://doi.org/10.1016/0021-9991(88)90091-5
Parallel octree-based hexahedral mesh generation for eulerian to lagrangian conversion.

Technical Report Staten, Matthew L ; Owen, Steven James

Computational simulation must often be performed on domains where materials are represented as scalar quantities or volume fractions at cell centers of an octree-based grid. Common examples include bio-medical, geotechnical or shock physics calculations where interface boundaries are represented only as discrete statistical approximations. In this work, we introduce new methods for generating Lagrangian computational meshes from Eulerian-based data. We focus specifically on shock physics problems that are relevant to ASC codes such as CTH and Alegra. New procedures for generating all-hexahedral finite element meshes from volume fraction data are introduced. A new primal-contouring approach is introduced for defining amore »« less
https://doi.org/10.2172/1008123

Full Text Available
Cell projection of meshes with non-planar faces

Conference Max, N ; Williams, P ; Silva, C

Volume rendering converts a scalar function on a 3D volume into varying colors and opacities, and creates an image by integrating the color and opacity effects along viewing rays through each pixel [1]. For data specified on a regular grid, the ray tracing is straightforward [2,3,4,5], and similar effects can be obtained with 3D textures [6]. For curvilinear or irregular grids, these methods are only applicable after the data has been resampled. An alternative, which works directly on these more general grids, is cell projection [7,8,9]. The cells composited onto the image in back to front sorted order. The projectionsmore »« less
https://doi.org/10.1007/978-1-4615-1177-9_11

Full Text Available
New concept of hexahedral mesh generation for arbitrary 3D domain - block degeneration method

Conference Taniguchi, Takeo ; Katagiri, Hiroki

This paper includes a new idea to generate hexahedral finite elements in order to obtain better numerical of arbitrary 3D domain results of finite element analysis. One of the complexities to obtain hexahedral meshes comes from the topological properties of generated elements, and the idea proposed in this paper first determines the topology of subdomains forming whole domain as to be divided into hexahedral elements, and each subdomain is then divided into hexahedral elements. As the configuration of subdomains the method prepares three geometries, i.e., triangular and rectangular prisms and hexahedron. Arbitrary 3D domain is divided first into 27 subdomainsmore »« less

Similar Records