Simplicial partitions are suitable to divide a bounded area in
branch and bound. In the iterative re nement process, a popular strategy
is to divide simplices by their longest edge, thus avoiding needle-shaped
simplices. A range of possibilities arises in higher dimensions where the
number of longest edges in a simplex is greater than one. The behaviour
of the search and the resulting binary search tree depend on the se-
lected longest edge. In this work, we investigate different rules to select a
longest edge and study the resulting efficiency of the branch and bound
algorithm.
Buscar en Dimension