187 |
|
Int_t nBinY= limit_ref->GetYaxis()->GetNbins(); |
188 |
|
for(int i=1; i<(nBinX+1); i++) { |
189 |
|
for(int j=1; j<(nBinY+1); j++) { |
190 |
+ |
if(limit_ref->GetBinContent(i,j-1)==0) continue; |
191 |
+ |
if(limit_ref->GetBinContent(i,j+1)==0) continue; |
192 |
+ |
if(limit_ref->GetBinContent(i,j)==0) continue; |
193 |
|
if( limit_ref->GetBinContent(i,j)>0. && limit_ref->GetBinContent(i,j)<=1.) { |
194 |
|
double xsLimitAbove = limit_ref->GetBinContent(i, j+1); |
195 |
|
double xsLimitBelow = limit_ref->GetBinContent(i, j-1); |
241 |
|
const int newCounter=counter; |
242 |
|
Double_t newPointsX[newCounter+1]; |
243 |
|
Double_t newPointsY[newCounter+1]; |
244 |
+ |
float lastx=-100; |
245 |
+ |
float lasty=-100; |
246 |
+ |
|
247 |
|
|
248 |
|
for (int ix = 0; ix < counter+1; ++ix) { |
249 |
|
if(ix<(foundDiag-2)) continue; |
250 |
|
if(ix!=counter && pointsX[ix+1]==pointsX[ix]) continue; |
251 |
+ |
if(pointsX[ix]<PlottingSetup::mglustart) continue; |
252 |
+ |
if(lasty>-100&&pointsY[ix]<51) continue; |
253 |
+ |
// cout << pointsX[ix] << " , " << pointsY[ix] << endl; |
254 |
|
newPointsX[ixNew]=pointsX[ix]; |
255 |
|
newPointsY[ixNew]=pointsY[ix]; |
256 |
|
ixNew++; |
257 |
+ |
lastx=pointsX[ix]; |
258 |
+ |
lasty=pointsY[ix]; |
259 |
|
} |
260 |
|
string titleHisto="tester"; |
261 |
|
// sprintf(titleHisto,"graph_%s_%f",limit_ref->GetName(),refMult); |
266 |
|
gr->Draw("same"); |
267 |
|
return gr; |
268 |
|
} |
269 |
+ |
|
270 |
|
TGraph *MarcosExclusionLine(TH2F *exclusionshape, int scantype) { |
271 |
+ |
// write_warning(__FUNCTION__,"USING MARIAS ALGORITHM..."); |
272 |
+ |
// return get_exclusion_line(exclusionshape); |
273 |
+ |
|
274 |
|
TH2F *fakehisto = flipth2f(exclusionshape); |
275 |
|
TGraph *fakegraph = get_mSUGRA_exclusion_line(fakehisto, scantype); |
276 |
|
TGraph *realgraph = new TGraph(fakegraph->GetN()); |