Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement

DOI10.1007/S10878-015-9970-YMaRDI QIDQ511686zbMATH OpenOpenAlexDBLPWikidataFDO

Authors G. Aparicio, José M. G. Salmerón, L. G. Casado, I. García, E. M. T. Hendrix, Boglárka G.-Tóth

Publication date 22 February 2017

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10878-015-9970-y

zbMATH Keywords

combinatorial optimizationbranch-and-boundregular simplexlongest edge bisectionbisection sequence

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• On the minimum number of simplex shapes in longest edge bisection refinement of a regular \(n\)-simplex
• scientific article; zbMATH DE number 6869275
• On refinement of the unit simplex using regular simplices
• On generalized bisection of 𝑛-simplices
• Properties of triangulations obtained by the longest-edge bisection

Cites work

• A comparison of adaptive refinement techniques for elliptic problems
• On generalized bisection of 𝑛-simplices
• On the Bisection Method for Triangles
• On the minimum number of simplex shapes in longest edge bisection refinement of a regular \(n\)-simplex

Cited in

(5)

• Properties of the multidimensional finite elements
• On the minimum number of simplex shapes in longest edge bisection refinement of a regular \(n\)-simplex
• Globally maximizing the sum of squares of quadratic forms over the unit sphere
• On refinement of the unit simplex using regular simplices
• On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic

This page was built for publication: Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511686)