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

Remove TAB

This commit is contained in:
Marc Glisse 2020-07-07 17:51:29 +02:00
parent e0513c2432
commit 00efb5ebef
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
NewKernel_d/include/CGAL/NewKernel_d/function_objects_cartesian.h
View File

@ -689,19 +689,19 @@ template <class R_> struct Construct_circumcenter : Store_kernel<R_> {
Vec b = typename CVec::Dimension()(k-1); Vec b = typename CVec::Dimension()(k-1);
std::vector<Vector> vecs; vecs.reserve(k-1); std::vector<Vector> vecs; vecs.reserve(k-1);
while(++f!=e) while(++f!=e)
vecs.emplace_back(dp(*f,p0)); vecs.emplace_back(dp(*f,p0));
// Only need to fill the lower half // Only need to fill the lower half
for(int i=0;i<k-1;++i){ for(int i=0;i<k-1;++i){
for(int j=i;j<k-1;++j) for(int j=i;j<k-1;++j)
m(j,i)=sp(vecs[i],vecs[j]); m(j,i)=sp(vecs[i],vecs[j]);
b[i]=m(i,i)/2; b[i]=m(i,i)/2;
} }
// Assumes Eigen... // Assumes Eigen...
Vec res=m.ldlt().solve(b); Vec res=m.ldlt().solve(b);
Point center=p0; Point center=p0;
// Wasteful if we only want the radius // Wasteful if we only want the radius
for(int i=0;i<k-1;++i) for(int i=0;i<k-1;++i)
center=tp(center,sv(vecs[i],res[i])); center=tp(center,sv(vecs[i],res[i]));
return center; return center;
} }
} }