USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS

DOI<581::AID-NME45>3.0.CO;2-K 10.1002/(SICI)1097-0207(19970228)40:4<581::AID-NME45>3.0.CO;2-KzbMath0883.65126OpenAlexW2149990129MaRDI QIDQ4360596

Patricio Inostroza, Maria-Cecilia Rivara

Publication date: 23 March 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0207(19970228)40:4<581::aid-nme45>3.0.co;2-k

zbMATH Keywords

image processingfractalsDelaunay triangulationsadaptive refinement/derefinement of triangulationslongest-side bisection algorithmsmultiqrid finite element methodstriangulation refinement algorithms

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Unnamed Item ⋮ Adaptive meshing in a mixed regime hydrologic simulation model ⋮ Efficient simulation of parameter‐dependent vehicle dynamics ⋮ On structural safety assessment by load factor maximization in piecewise linear plasticity ⋮ 2D and 3D finite element meshing and remeshing ⋮ Numerical simulation of the slider air bearing problem of hard disk drives by two multidimensional upwind residual distribution schemes over unstructured triangular meshes ⋮ Natural hierarchical refinement for finite element methods ⋮ Block-balanced meshes in iterative uniform refinement ⋮ Residual-based a posteriori error estimates of nonconforming finite element method for elliptic problems with Dirac delta source terms ⋮ Reverse adaptivity?a new evolutionary tool for structural optimization ⋮ Local refinement based on the 7-triangle longest-edge partition

Cites Work

• Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
• Selective refinement/derefinement algorithms for sequences of nested triangulations
• Mesh Refinement Processes Based on the Generalized Bisection of Simplices
• Design and data structure of fully adaptive, multigrid, finite-element software
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• A grid generator based on 4-triangles conforming mesh-refinement algorithms
• A fast algorithm for constructing Delaunay triangulations in the plane
• Algorithms for surface fitting using Powell-Sabin splines
• A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
• Mesh generation/refinement using fractal concepts and iterated function systems
• COMPUTATIONAL GEOMETRY COLUMN 23
• An algorithm for adaptive refinement of triangular element meshes