songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

- Fixed bug in update(LPAlgorithm): Termination was not guaranteed until 

now which led to an infinite loop on Intel.
This commit is contained in:
Kaspar Fischer 2003-03-03 13:18:59 +00:00
parent bbc38317b3
commit fbc5a82ea9
2 changed files with 5 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
Packages/Min_sphere_of_spheres_d/include/CGAL/Min_sphere_of_spheres_d.C
View File

@ -83,8 +83,7 @@ namespace CGAL_MINIBALL_NAMESPACE {
for (i=e; i<n; ++i)
if (!ss.contains(t.center_cartesian_begin(l[i]),
t.radius(l[i]),Tol,Is_exact())) {
pivot(i);
t.radius(l[i]),Tol,Is_exact()) && pivot(i)) {
k = i+1;
break;
}

8
Packages/Min_sphere_of_spheres_d/web/Min_sphere_of_spheres_d.fw
View File

@ -3064,8 +3064,7 @@ void Min_sphere_of_spheres_d<Traits>::update(LP_algorithm) {
for (i=e; i<n; ++i)
if (!ss.contains(t.center_cartesian_begin(l[i]),
t.radius(l[i]),Tol,Is_exact())) {
pivot(i);
t.radius(l[i]),Tol,Is_exact()) && pivot(i)) {
k = i+1;
break;
}
@ -3075,8 +3074,9 @@ void Min_sphere_of_spheres_d<Traits>::update(LP_algorithm) {
%
This works fine in theory. However, for approximate computation our
implementation of \code{pivot()} might fail under certain
circumstances, so termination is not guaranteed. That's why this
algorithm is not the default algorithm.
circumstances. In such a case we proceed as if the violating ball
were contained in the current ball. In this way, termination is
guaranteed.
%
\subsection{The implementation of the farthest-first heuristic}
%