On refinement of the unit simplex using regular simplices
From MaRDI portal
Recommendations
- On the minimum number of simplex shapes in longest edge bisection refinement of a regular n-simplex
- On generalized bisection of 𝑛-simplices
- scientific article; zbMATH DE number 6869275
- Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
- Bisecton by global optimization revisited
Cites work
- Bisecton by global optimization revisited
- On determining the cover of a simplex by spheres centered at its vertices
- On generalized bisection of 𝑛-simplices
- On the exhaustivity of simplicial partitioning
- On the minimum number of simplex shapes in longest edge bisection refinement of a regular n-simplex
- Red refinements of simplices into congruent subsimplices
- Simplicial global optimization
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
Cited in
(5)- Stable subdivision of 4D polytopes
- On the minimum number of simplex shapes in longest edge bisection refinement of a regular n-simplex
- Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
- (Global) optimization: historical notes and recent developments
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
This page was built for publication: On refinement of the unit simplex using regular simplices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964244)
