Properties of triangulations obtained by the longest-edge bisection
DOI10.2478/S11533-014-0448-4zbMATH Open1315.51018OpenAlexW1980829046MaRDI QIDQ403206FDOQ403206
Authors: Francisco Perdomo, Ángel Plaza 
Publication date: 29 August 2014
Published in: Central European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/s11533-014-0448-4
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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Angle Condition in the Finite Element Method
- On semiregular families of triangulations and linear interpolation
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry
- On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions
- Non-degeneracy study of the 8-tetrahedra longest-edge partition
- A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
- Title not available (Why is that?)
- Manhattan orbifolds
- On global and local mesh refinements by a generalized conforming bisection algorithm
- A new proof of the degeneracy property of the longest-edge \(n\)-section refinement scheme for triangular meshes
- Complexity of the bisection method
- Mesh quality improvement and other properties in the four-triangles longest-edge partition
- A comparative study between some bisection based partitions in 3D
- On the Bisection Method for Triangles
- Mesh Refinement Processes Based on the Generalized Bisection of Simplices
- On Faster Convergence of the Bisection Method for all Triangles
- Title not available (Why is that?)
- On Faster Convergence of the Bisection Method for Certain Triangles
- Glimpses of Algebra and Geometry
- Title not available (Why is that?)
- A geometric diagram and hybrid scheme for triangle subdivision
- Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric
Cited In (6)
- Longest-edge \(n\)-section algorithms: properties and open problems
- On the non-degeneracy property of the longest-edge trisection of triangles
- Triangulation refinement by using edge subdivision
- Mesh quality improvement and other properties in the four-triangles longest-edge partition
- Tesselation of a triangle by repeated barycentric subdivision
- 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)
