ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
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
    A new mesh generation scheme for arbitrary planar domains (1985)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 21 (1985), S. 1403-1426 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: This paper describes a new algorithm to generate interior nodes within any arbitrary multi-connected regions. The boundary nodes and the interior nodes are then linked up to form the best possible triangular elements by a completely revised technique in an efficient and stable manner. Owing to the generality of the central generation program, the global domain is allowed to be divided into as many irregular subdomains as desired, in order to model closely the actual physical situation. Moreover, the boundaries of the sub-domains are updated from time to time when necessary to include the possibilities of progressive refinement around a sharp corner, generating radiating mesh from a prescribed node, generating mesh between two circular arcs, etc. Despite its flexibility and capabilities, data for triangulation have been kept to a minimum by a logical input module; no connectivity information between subregions is needed, and common boundaries are defined once only. All these features have contributed to a powerful method to generate 3-node or 6-node triangular element meshes of great variety within the most irregular heterogeneous regions.
    Additional Material: 28 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620210805
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Stress evaluation algorithms for rate constitutive equations in finite deformation analysis (1988)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 26 (1988), S. 121-141 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The stress integration algorithm for hypoelastic constitutive equations proposed by Pinsky et al.3 is extended for the treatment of finite deformation elastoplastic constitutive relations. Another approach based on the polar decomposition of the deformation gradient tensor F = R · U is also introduced. Numerical examples and a discussion on these two approaches are given.
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620260109
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Delaunay triangulation of non-convex planar domains (1989)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 28 (1989), S. 2695-2707 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: This paper investigates the possibility of integrating the two currently most popular mesh generation techniques, namely the method of advancing front and the Delaunay triangulation algorithm. The merits of the resulting scheme are its simplicity, efficiency and versatility. With the introduction of ‘non-Delaunay’ line segments, the concept of using Delaunay triangulation as a means of mesh generation is clarified.An efficient algorithm is proposed for the construction of Delaunay triangulations over non-convex planar domains. Interior nodes are first generated within the planar domain. These interior nodes and the boundary nodes are then linked up together to produce a valid triangulation. In the mesh generation process, the Delaunay property of each triangle is ensured by selecting a node having the smallest associated circumcircle. In contrast to convex domains, intersection between the proposed triangle and the domain boundary has to be checked; this can be simply done by considering only the ‘non-Delaunay’ segments on the generation front.Through the study of numerous examples of various characteristics, it is found that high-quality triangular element meshes are obtained by the proposed algorithm, and the mesh generation time bears a linear relationship with the number of elements/nodes of the triangulation.
    Additional Material: 11 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620281113
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Perspective projection of non-convex polyhedra (1988)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 26 (1988), S. 1485-1506 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: An algorithm is presented for removing hidden lines for isometric and perspective projections of three-dimensional objects. An object can be regarded as being made up of a number of planes, and the whole picture can therefore be visualized as only a collection of planes. Considering planes as the basic element of a picture, non-convex polyhedra can be displayed directly without prior subdivisions into convex ones. Lines connecting nodal points are first retrieved from the model to be plotted by a simple but efficient technique. On the picture planes, each unique line is examined in turn to see if it is totally or partially hidden. The intersections between a unique line and a projected plane (with or without openings) are determined by a new method which, even in the presence of numerical errors, will always give correct intersection information. Unlike many classical algorithms, intersections are determined by a single formula without tedious case subdivisions. With little additional calculations, object penetrations can also be tackled.
    Additional Material: 16 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620260703
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Automatic mesh generation over intersecting surfaces (1995)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 38 (1995), S. 943-954 
    Details
    ISSN: 0029-5981
    Keywords: surface intersection ; finite element generation ; triangular facets ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A fully automatic general scheme is proposed to determine and analyse the intersections between two groups of surfaces composed of triangular facets. By carefully maintaining the spatial position of the lines of intersection in regenerating mesh locally around surface intersections, pieces of surfaces can be arbitrarily combined and merged. A great variety of objects can be easily created by selectively putting together different surface parts derived from surface intersections. The new algorithm is best applied in conjunction with an existing surface mesh generator to enhance its general capability in dealing with objects built from intersecting surfaces. In fact, it is a powerful surface mesh manipulator, and through the repeated use of the process, complex structures can be rapidly and accurately constructed.
    Additional Material: 9 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620380605
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    An automatic adaptive refinement finite element procedure for 2D elastostatic analysis (1992)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 35 (1992), S. 1967-1989 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: An automatic adaptive refinement procedure for finite element analysis is presented. The procedure is applied to two-dimensional elastostatic problems to obtain solutions of prescribed accuracy. Through the combined use of new mesh generator using contour developed by Lo1 and the concept of strain energy concentration, high-quality graded finite element meshes are generated. The whole process is fully automatic and no user intervention is required during the successive cycles of the mesh refinements. The Zienkiewicz and Zhu2 error estimator is found to be effective and has been adopted for the present implementation. In the numerical examples tested, the error estimator gives an accurate error norm estimation and the effectivity index of the estimator converges to a value close to unity.
    Additional Material: 12 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620351004
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    OPTIMAL DELAUNAY POINT INSERTION (1996)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 39 (1996), S. 3407-3437 
    Details
    ISSN: 0029-5981
    Keywords: Delaunay triangulation ; Voronoï tesselation ; convex hull ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: An efficient algorithm for Delaunay triangulation of a given set of points in d dimensions is presented. Various steps of the point insertion algorithm are reviewed and many acceleration procedures are implemented to speed up the triangulation process. New features include the search for a neighbouring point by a layering scheme, locating the containing simplex by a random walk, formulas of important geometrical quantities of a new simplex based on those of an old one, a novel approach in establishing the adjacency relationship using connection matrices. The resulting scheme seems to be one of the fastest triangulation algorithms known, which enables us to generate tetrahedra in ∝3 with a linear generation rate of 15 000 tetrahedra per second for randomly generated points on an HP 735 workstation.
    Additional Material: 35 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
  • 8
    Electronic Resource
    Electronic Resource
    Automatic mesh generation and adaptation by using contours (1991)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 31 (1991), S. 689-707 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A general and efficient remeshing algorithm is presented for the discretization of arbitrary planar domains into triangular elements in consistency with the given node spacing function.The contour lines of the node spacing function at suitable calculated levels provide the natural lines of division of the problem domain into subregions, where finite element meshes of different element sizes are generated using the available general-purpose mesh generators.1, 2Examples of remeshing for various node spacing functions are given to illustrate that high-quality gradation meshes can be generated automatically without any user's intervention by this simple contour line method.
    Additional Material: 20 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620310405
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...