1. Home
  2. Issues
  3. Volume 26, Issue 1 (2015)
  4. On the Minimum Number of Simplex Shapes ...

Informatica


Cited by 12
On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex

Estimating the Number of Similarity Classes for Marked Bisection in General Dimensions
Guillem Belda-Ferrín, Eloi Ruiz-Gironés, Xevi Roca
https://doi.org/10.1007/978-3-031-40594-5_13
Book:  Lecture Notes in Computational Science and Engineering (SIAM International Meshing Roundtable 2023) Volume 147 (2024), p. 271
2023 IEEE International Conference on Agents (ICA)
Adel Magra, Tim Baarslag, Peter Spreij
https://doi.org/10.1109/ICA58824.2023.00021
Conference:  (2023), p. 71
A Weak Compatibility Condition for Newest Vertex Bisection in Any Dimension
Martin Alkämper, Fernando Gaspoz, Robert Klöfkorn
https://doi.org/10.1137/17M1156137
Journal:  SIAM Journal on Scientific Computing Volume 40, Issue 6 (2018), p. A3853
Computing the Exact Number of Similarity Classes in the Longest Edge Bisection of Tetrahedra
Jose P. Suárez, Agustín Trujillo, Tania Moreno
https://doi.org/10.3390/math9121447
Journal:  Mathematics Volume 9, Issue 12 (2021), p. 1447
Finite number of similarity classes in Longest Edge Bisection of nearly equilateral tetrahedra
Agustín Trujillo-Pino, Jose Pablo Suárez, Miguel A. Padrón
https://doi.org/10.1016/j.amc.2024.128631
Journal:  Applied Mathematics and Computation Volume 472 (2024), p. 128631
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
J. M. G. Salmerón, G. Aparicio, L. G. Casado, I. García, E. M. T. Hendrix, B. G.-Tóth
https://doi.org/10.1007/s10878-015-9970-y
Journal:  Journal of Combinatorial Optimization Volume 33, Issue 2 (2017), p. 389
Globally maximizing the sum of squares of quadratic forms over the unit sphere
Xiaoli Cen, Yong Xia
https://doi.org/10.1007/s11590-019-01498-7
Journal:  Optimization Letters Volume 14, Issue 7 (2020), p. 1907
On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound
Boglárka G.-Tóth, Eligius M. T. Hendrix, Leocadio G. Casado, Frédéric Messine
https://doi.org/10.1007/s10957-024-02480-9
Journal:  Journal of Optimization Theory and Applications (2024)
On derivative based bounding for simplicial branch and bound
Eligius M. T. Hendrix, Boglarka G. -Tóth, Frederic Messine, Leocadio G. Casado
https://doi.org/10.1051/ro/2021081
Journal:  RAIRO - Operations Research Volume 55, Issue 3 (2021), p. 2023
On refinement of the unit simplex using regular simplices
B. G.-Tóth, E. M. T. Hendrix, L. G. Casado, I. García
https://doi.org/10.1007/s10898-015-0363-7
Journal:  Journal of Global Optimization Volume 64, Issue 2 (2016), p. 305
Parallel algorithms for computing the smallest binary tree size in unit simplex refinement
G. Aparicio, J.M.G. Salmerón, L.G. Casado, R. Asenjo, E.M.T. Hendrix
https://doi.org/10.1016/j.jpdc.2017.05.016
Journal:  Journal of Parallel and Distributed Computing Volume 112 (2018), p. 166
Similarity Classes in the Eight-Tetrahedron Longest-Edge Partition of a Regular Tetrahedron
Miguel A. Padrón, Ángel Plaza, José Pablo Suárez
https://doi.org/10.3390/math11214456
Journal:  Mathematics Volume 11, Issue 21 (2023), p. 4456


Share


RSS