A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side

From MaRDI portal
Publication:4057524

DOI10.2307/2005558zbMath0302.65085OpenAlexW4234701944MaRDI QIDQ4057524

Ivo G. Rosenberg, Frank Stenger

Publication date: 1975

Full work available at URL: https://doi.org/10.2307/2005558




Related Items (38)

Complexity of the bisection methodRefinement based on longest-edge and self-similar four-triangle partitionsMesh quality improvement and other properties in the four-triangles longest-edge partitionA learning heuristic for space mapping and searching self-organizing systems using adaptive mesh refinementOn Faster Convergence of the Bisection Method for Certain TrianglesEstimateurs a posteriori d'erreur pour le calcul adaptatif d'écoulements quasi-newtoniensFlexible multibody dynamics and adaptive finite element techniques for model synthesis and estimationAdaptive error control in multi-physical thin-structure MEMS FE-simulationOn Faster Convergence of the Bisection Method for all TrianglesProperties of triangulations obtained by the longest-edge bisectionImproved Maximum Angle Estimate for Longest-Edge BisectionMultithread parallelization of LEPP-bisection algorithmsOn the construction of sufficient refinements for computation of topological degreeAn adaptive finite element method for evolutionary convection dominated problemsPropagation of longest-edge mesh patterns in local adaptive refinementProving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metricOn global and local mesh refinements by a generalized conforming bisection algorithmAn adaptive boundary-element approach to 3D transient free-surface flow of viscous fluidsThe limit property for the interior solid angles of some refinement schemes for simplicial meshesConstraint-free adaptive FEMs on quadrilateral nonconforming meshesTuned Terminal Triangles Centroid Delaunay Algorithm for Quality TriangulationThere are simple and robust refinements (almost) as good as DelaunayA mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisectionA new proof of the degeneracy property of the longest-edge \(n\)-section refinement scheme for triangular meshesOn the non-degeneracy property of the longest-edge trisection of trianglesThree-dimensional transient free-surface rotating creeping flowHexahedral constraint-free finite element method on meshes with hanging nodesOn the existence of strongly regular families of triangulations for domains with a piecewise smooth boundary.Properties of the longest-edge \(n\)-section refinement scheme for triangular meshesOn the Shape of Tetrahedra from BisectionBlock-balanced meshes in iterative uniform refinementPublications by, and About, Frank StengerLongest-edge \(n\)-section algorithms: properties and open problemsLocal refinement based on the 7-triangle longest-edge partitionLepp-bisection algorithms, applications and mathematical propertiesNon-degeneracy study of the 8-tetrahedra longest-edge partitionOn generalized bisection of 𝑛-simplicesAdaptive contouring of three-dimensional surfaces



Cites Work


This page was built for publication: A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side