Properties of triangulations obtained by the longest-edge bisection
From MaRDI portal
(Redirected from Publication:403206)
Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Polyhedra and polytopes; regular figures, division of spaces (51M20) Elementary problems in hyperbolic and elliptic geometries (51M09)
Recommendations
- On the non-degeneracy property of the longest-edge trisection of triangles
- scientific article; zbMATH DE number 1189327
- Properties of n-dimensional triangulations
- Some properties of triangulation
- scientific article; zbMATH DE number 1163631
- On Short Edges in Straight-Edge Triangulations.
- A separation property of planar triangulations
- Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric
- Longest-edge \(n\)-section algorithms: properties and open problems
- On properties of random dissections and triangulations
Cites work
- scientific article; zbMATH DE number 1194132 (Why is no real title available?)
- scientific article; zbMATH DE number 53298 (Why is no real title available?)
- scientific article; zbMATH DE number 108182 (Why is no real title available?)
- scientific article; zbMATH DE number 3596197 (Why is no real title available?)
- scientific article; zbMATH DE number 205888 (Why is no real title available?)
- scientific article; zbMATH DE number 1830718 (Why is no real title available?)
- A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
- A comparative study between some bisection based partitions in 3D
- A geometric diagram and hybrid scheme for triangle subdivision
- A new proof of the degeneracy property of the longest-edge \(n\)-section refinement scheme for triangular meshes
- Complexity of the bisection method
- Glimpses of Algebra and Geometry
- Manhattan orbifolds
- Mesh Refinement Processes Based on the Generalized Bisection of Simplices
- Mesh quality improvement and other properties in the four-triangles longest-edge partition
- Non-degeneracy study of the 8-tetrahedra longest-edge partition
- On Faster Convergence of the Bisection Method for Certain Triangles
- On Faster Convergence of the Bisection Method for all Triangles
- On global and local mesh refinements by a generalized conforming bisection algorithm
- On semiregular families of triangulations and linear interpolation
- On the Angle Condition in the Finite Element Method
- On the Bisection Method for Triangles
- On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions
- Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry
Cited in
(15)- Finite number of similarity classes in longest edge bisection of nearly equilateral tetrahedra
- Longest-edge \(n\)-section algorithms: properties and open problems
- Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric
- On the non-degeneracy property of the longest-edge trisection of triangles
- Two-sided estimation of diameters reduction rate for the longest edge \(n\)-section of triangles with \(n\geqslant 4\)
- Triangulation refinement by using edge subdivision
- A new proof of the degeneracy property of the longest-edge \(n\)-section refinement scheme for triangular meshes
- Mesh quality improvement and other properties in the four-triangles longest-edge partition
- Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes
- Improved maximum angle estimate for longest-edge bisection
- Strong regularity of a family of face-to-face partitions generated by the longest-edge bisection algorithm
- Tesselation of a triangle by repeated barycentric subdivision
- Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
- The longest-edge bisection algorithm may produce degenerating tetrahedra
- LATIN 2004: Theoretical Informatics
This page was built for publication: Properties of triangulations obtained by the longest-edge bisection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403206)
