Lepp-bisection algorithms, applications and mathematical properties

DOI10.1016/j.apnum.2008.12.011zbMath1167.65343OpenAlexW2039953181MaRDI QIDQ1030788

Maria-Cecilia Rivara

Publication date: 2 July 2009

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2008.12.011

zbMATH Keywords

triangulationfinite element methodvisualizationnumerical examplesparallel computationmultigrid methodsbisection methodrefinement algorithmmultiresolution algorithmslongest edge bisectionterrain modelingright-triangle bintree triangulation

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Parallel numerical computation (65Y05)

Related Items

Soft Subdivision Search in Motion Planning, II: Axiomatics, Minimising the error in eigenvalue calculations involving the Boltzmann transport equation using goal-based adaptivity on unstructured meshes, Multithread parallelization of LEPP-bisection algorithms, Least-squares finite element solution of Euler equations with H-type mesh refinement and coarsening on triangular elements, On global and local mesh refinements by a generalized conforming bisection algorithm, Terminal Star Operations Algorithm for Tetrahedral Mesh Improvement, A hybrid variational front tracking-level set mesh generator for problems exhibiting large deformations and topological changes, Longest-edge \(n\)-section algorithms: properties and open problems

Uses Software

• PLTMG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A geometric diagram and hybrid scheme for triangle subdivision
• Adaptive refinement of unstructured finite-element meshes
• Complexity of the bisection method
• Geometry and Topology for Mesh Generation
• Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
• Selective refinement/derefinement algorithms for sequences of nested triangulations
• On the Bisection Method for Triangles
• Design and data structure of fully adaptive, multigrid, finite-element software
• On Faster Convergence of the Bisection Method for all Triangles
• A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
• A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
• A Proof of Convergence and an Error Bound for the Method of Bisection in R n
• COMPUTATIONAL GEOMETRY COLUMN 23
• PLTMG: A Software Package for Solving Elliptic Partial Differential Equations
• Improving the quality of meshes for the simulation of semiconductor devices using Lepp‐based algorithms
• An algorithm for adaptive refinement of triangular element meshes
• Automatic construction of non-obtuse boundary and/or interface Delaunay triangulations for control volume methods
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Quality Local Refinement of Tetrahedral Meshes Based on Bisection
• Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes
• Right-triangulated irregular networks