Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Engineering with computers 12 (1996), S. 144-154 
    ISSN: 1435-5663
    Keywords: Automatic mesh generation ; Mesh control ; Mapped meshing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Technology
    Notes: Abstract This paper presents generated enhancements for robust ‘two and three-quarter dimensional meshing’, including: (1) automated interval assignment by integer programming for submapped surfaces and volumes, (2) surface submapping, and (3) volume submapping. An introduction to the simplex method, an optimization technique of integer programming, is presented. Simplification of complex geometry is required for the formulation of the integer programming problem. A method of ‘i-j unfolding’ is defined which explains how irregular geometry can be realigned into a simplified form that is suitable for submap interval assignment solutions. Also presented is the processes by which submapping eliminates the decomposition of surface geometry, through a pseudodecomposition process, producing suitable mapped meshes. The process of submapping involves the creation of ‘interpolated virtual edges’, user defined ‘vertex types’ and ‘i-j-k space’ traversals. The creation of ‘interpolated virtual edges’ is the method by which submapping automatically subdivides surface geometry. The ‘interpolated virtual edge’ is formulated according to an interpolation scheme using the node discretization of curves on the surface. User defined ‘vertex types’ allow direct user control of surface decomposition and interval assignment by modifying ‘i-j-k space’ traversals. Volume submapping takes the geometry decomposition to a higher level by using ‘mapped virtual surfaces’ to eliminate decomposition of complex volumes.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 39 (1996), S. 1475-1489 
    ISSN: 0029-5981
    Keywords: meshing ; three-dimensional ; surfaces ; quadrilateral ; finite element ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: This paper discusses the extension of the paving algorithm for all quadrilateral mesh generation to arbitrary three-dimensional trimmed surfaces. Methods of calculating angles, projecting elements, and detecting collisions between paving boundaries, for general surfaces are presented. Extensions of the smoothing algorithms for three dimensions are set forth. Advances in the use of scalar sizing functions are presented. These functions can be used to better approximate internal mesh density from boundary densities and surface characteristics.
    Additional Material: 16 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 39 (1996), S. 3327-3349 
    ISSN: 0029-5981
    Keywords: mesh generation ; hexahedral ; whisker weaving ; duality ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: This paper introduces a new algorithm called whisker weaving for constructing unstructured, all-hexahedral finite element meshes. Whisker weaving is based on the Spatial Twist Continuum (STC), a global interpretation of the geometric dual of an all-hexahedral mesh. Whisker weaving begins with a closed, all-quadrilateral surface mesh bounding a solid geometry, then constructs hexahedral element connectivity advancing into the solid. The result of the whisker weaving algorithm is a complete representation of hex mesh connectivity only: Actual mesh node locations are determined afterwards.The basic step of whisker weaving is to form a hexahedral element by crossing or intersecting dual entities. This operation, combined with seaming or joining operations in dual space, is sufficient to mesh simple block problems. When meshing more complex geometries, certain other dual entities appear such as blind chords, merged sheets, and self-intersecting chords. Occasionally specific types of invalid connectivity arise. These are detected by a general method based on repeated STC edges. This leads into a strategy for resolving some cases of invalidities immediately.The whisker weaving implementation has so far been successful at generating meshes for simple block-type geometries and for some non-block geometries. Mesh sizes are currently limited to a few hundred elements. While the size and complexity of meshes generated by whisker weaving are currently limited, the algorithm shows promise for extension to much more general problems.
    Additional Material: 25 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...