Efficient data structures for adaptive remeshing with the FEM (Q2639620): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some useful data structures for the generation of unstructured grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive mesh refinement processes for finite element solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient worst-case data structures for range searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3735043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound on the Complexity of Orthogonal Range Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4154035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Dirichlet Tessellations in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic triangulation of arbitrary planar domains for the finite element method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new mesh generation scheme for arbitrary planar domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive remeshing for compressible flow computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic three-dimensional mesh generation by the modified-octree technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for interpolation and localization in irregular 2D meshes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:11, 21 June 2024

scientific article
Language Label Description Also known as
English
Efficient data structures for adaptive remeshing with the FEM
scientific article

    Statements

    Efficient data structures for adaptive remeshing with the FEM (English)
    0 references
    0 references
    0 references
    1990
    0 references
    The authors analyze the meshing and interpolation problems encountered in adaptive remeshing with unstructured grids. The solution is searched for separately using specific data structures based on bisection. The finite element method as well as the proposed procedure being used here may be generalized to three-dimensional problems. The implementation algorithms and timing are exposed in two dimensions. The structures can also be used to solve the geometrical problems being associated with some other numerical methods.
    0 references
    0 references
    finite element method
    0 references
    interpolation
    0 references
    adaptive remeshing
    0 references
    unstructured grids
    0 references
    data structures
    0 references

    Identifiers