Pages that link to "Item:Q747921"

The following pages link to Longest-edge \(n\)-section algorithms: properties and open problems (Q747921):

Displaying 9 items.

• Properties of triangulations obtained by the longest-edge bisection (Q403206) (← links)
• Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes (Q714517) (← links)
• On the maximum angle condition for the conforming longest-edge \(n\)-section algorithm for large values of \(n\) (Q1632306) (← links)
• Application of longest common subsequence algorithms to meshing of planar domains with quadrilaterals (Q1690343) (← links)
• On Zlámal minimum angle condition for the longest-edge \(n\)-section algorithm with \(n \geq 4\) (Q2008749) (← links)
• On degenerating finite element tetrahedral partitions (Q2676866) (← links)
• On Numerical Regularity of Trisection-Based Algorithms in 3D (Q2954441) (← links)
• Improved Maximum Angle Estimate for Longest-Edge Bisection (Q5104664) (← links)
• On Regularity of Tetrahedral Meshes Produced by Some Red-Type Refinements (Q5132183) (← links)