The following pages link to José P. Suárez (Q279019):
Displaying 30 items.
- Two-sided estimation of diameters reduction rate for the longest edge \(n\)-section of triangles with \(n\geqslant 4\) (Q279023) (← links)
- The limit property for the interior solid angles of some refinement schemes for simplicial meshes (Q457711) (← links)
- Non-equivalent partitions of \(d\)-triangles with Steiner points (Q598509) (← links)
- Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes (Q714517) (← links)
- Block-balanced meshes in iterative uniform refinement (Q733379) (← links)
- A geometric diagram and hybrid scheme for triangle subdivision (Q733390) (← links)
- Longest-edge \(n\)-section algorithms: properties and open problems (Q747921) (← links)
- On the non-degeneracy property of the longest-edge trisection of triangles (Q969154) (← links)
- Local refinement based on the 7-triangle longest-edge partition (Q1025330) (← links)
- Bi-factorial analysis for resolution of GPS equations. (Q1426748) (← links)
- Hamiltonian triangular refinements and space-filling curves (Q1624615) (← links)
- On the maximum angle condition for the conforming longest-edge \(n\)-section algorithm for large values of \(n\) (Q1632306) (← links)
- Adaptive techniques for unstructured nested meshes (Q1765501) (← links)
- A physical model for screen space distribution of 3D marks on geographical information systems (Q1997081) (← links)
- On Zlámal minimum angle condition for the longest-edge \(n\)-section algorithm with \(n \geq 4\) (Q2008749) (← links)
- There are simple and robust refinements (almost) as good as Delaunay (Q2229908) (← links)
- A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection (Q2229910) (← links)
- Refinement based on longest-edge and self-similar four-triangle partitions (Q2384517) (← links)
- Mesh quality improvement and other properties in the four-triangles longest-edge partition (Q2388565) (← links)
- A comparative study between some bisection based partitions in 3D (Q2573278) (← links)
- Non-degeneracy study of the 8-tetrahedra longest-edge partition (Q2573623) (← links)
- Graph-based data structures for skeleton-based refinement algorithms (Q2781036) (← links)
- (Q2953074) (← links)
- On Numerical Regularity of Trisection-Based Algorithms in 3D (Q2954441) (← links)
- (Q3423085) (← links)
- Propagation of longest-edge mesh patterns in local adaptive refinement (Q3515054) (← links)
- (Q3556760) (← links)
- (Q3606140) (← links)
- (Q4442072) (← links)
- Finite number of similarity classes in longest edge bisection of nearly equilateral tetrahedra (Q6132127) (← links)
