Wyniki wyszukiwania - Biblioteka Nauki

Ten serwis zostanie wyłączony 2025-02-11.

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

Znaleziono wyników: 5

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: generacja siatki

Sortuj według:

Ogranicz wyniki do:

Algorytm i program obliczeń nieliniowej filtracji ustalonej przez zapory jednorodne

100%

Wosiewicz B. , Sroka Z.

tom 5

The efficiency of the application of the heap lists to the algorithm of mesh generation

84%

Kucwaj J.

Computer Assisted Mechanics and Engineering Sciences

2010

tom Vol. 17, no. 2-3-4

137-145

The paper presents an analysis of the efficiency of the application of heap lists data structures to the 2D triangular mesh generation algorithms. Such efficiency is especially important for the frontal methods for which the size of the generated mesh is controlled by a prescribed function in the considered domain. In the presented approach two advancing front procedures are presented: first for points insertion and the second for the Delaunay triangulation. If the heap lists are applied to the minimal size of frontal segment selection, a better quality mesh is obtained.

Numerical investigations of the convergence of a remeshing algorithm on an example of subsonic flow

84%

Kucwaj J.

Computer Assisted Mechanics and Engineering Sciences

2010

tom Vol. 17, no. 2-3-4

149-160

The main goal of the paper is to analyze convergence of a remeshing scheme evaluated by the author [8] on the example of a potential flow around a profile. It is assumed that flow is stationary, irrotational, inviscid and compressible. The problem is led to solving nonlinear differential equation with additional nonlinear algebraic equation representing the so called Kutta-Joukovsky condition. For adaptation a remeshing scheme is applied. For every adaptation step mesh is generated using grid generator [7], which generates meshes with mesh size function. The mesh size function is modified at every adaptation step by nodal values of the error indicator interpolation. The nonlinear algebraic system of equations obtained from discretizing of the problem, is solved by the application of the Newton-Raphson method.

Definition and interpolation of discrete metric for mesh generation on 3D surfaces

84%

Głut B. , Jurczyk T.

Computer Science

2005

tom Vol. 7

89-103

The article concerns the problem of a definition of the control space from a set of discrete data (metric description gathered from different sources) and its influence on the efficiency of the generation process with respect to 2D and 3D surface meshes. Several methods of metric interpolation between these discrete points are inspected, including an automated selection of proper method. Some aspects of the procedures of creation and employment of the mesh control space based on the discrete set of points are presented. The results of using different variations of these methods are also included.

Artykuł opisuje zagadnienie definicji przestrzeni kontrolnej (sterującej procesem generowania siatek) na podstawie dyskretnych danych (opisu metryki pozyskanego z różnych zródeł) oraz jej wpływu na wydajność procesu generacji siatek na płaszczyźnie oraz powierzchniach trójwymiarowych. Rozpatrywane są różne metody interpolacji metryki w obszarach pomiędzy dyskretnymi punktami ze zdefiniowaną metryką, włącznie z automatyczną metodą wyboru odpowiedniej metody interpolacji. Przedstawione są zagadnienia związane z procesem tworzenia i wykorzystywania przestrzeni kontrolnej opartej na informacji z dyskretnego zbioru punktów. Załączone są także przykładowe wyniki zastosowania różnych wariantów opisywanych metod.

Improved GETMe by adaptive mesh smoothing

67%

Vartziotis D. , Papadrakakis M.

Computer Assisted Methods in Engineering and Science

2013

tom Vol. 20, no. 1

55--71

Mesh smoothing improves mesh quality by node relocation without altering mesh topology. Such methods play a vital role in finite element mesh improvement with a direct consequence on the quality of the discretized solution. In this work, an improved version of the recently proposed geometric element transformation method (GETMe) for mesh smoothing is presented. Key feature is the introduction of adaptive concepts, which improve the resulting mesh quality, reduce the number of parameters, and enhance the parallelization capabilities. Implementational aspects are discussed and results of a more efficient version are presented, which demonstrate that GETMe adaptive smoothing yields high quality meshes, is particularly fast, and has a comparably low memory profile. Furthermore, results are compared to those of other state-of-the-art smoothing methods.