diff --git a/graf2d/graf/inc/TCutG.h b/graf2d/graf/inc/TCutG.h index 868cf88e6c44f3d863fbdd66b303530da85614f5..ee270f2e7c0b3c92662e877afb7c54a6d7dd5484 100644 --- a/graf2d/graf/inc/TCutG.h +++ b/graf2d/graf/inc/TCutG.h @@ -48,7 +48,6 @@ public: const char *GetVarX() const {return fVarX.Data();} const char *GetVarY() const {return fVarY.Data();} virtual Double_t IntegralHist(TH2 *h, Option_t *option="") const; - virtual Int_t IsInside(Double_t x, Double_t y) const; virtual void SavePrimitive(ostream &out, Option_t *option = ""); virtual void SetObjectX(TObject *obj) {fObjectX = obj;} virtual void SetObjectY(TObject *obj) {fObjectY = obj;} diff --git a/graf2d/graf/src/TCutG.cxx b/graf2d/graf/src/TCutG.cxx index 63e835bae9c5089ed919695173a48fa9c6782480..749a524b1b4c4bc423f714e12328e49f0d7d96f4 100644 --- a/graf2d/graf/src/TCutG.cxx +++ b/graf2d/graf/src/TCutG.cxx @@ -342,27 +342,6 @@ Double_t TCutG::IntegralHist(TH2 *h, Option_t *option) const } -//______________________________________________________________________________ -Int_t TCutG::IsInside(Double_t x, Double_t y) const -{ - // Function which returns 1 if point x,y lies inside the polygon defined by - // the graph points 0 otherwise. This function assumes that the first and - // the last point of the TCutG are the same (closed polygon). - // - // Algorithm: - // The loop is executed with the end-point coordinates of a line segment - // (X1,Y1)-(X2,Y2) and the Y-coordinate of a horizontal line. - // The counter inter is incremented if the line (X1,Y1)-(X2,Y2) intersects - // the horizontal line. In this case XINT is set to the X-coordinate of the - // intersection point. If inter is an odd number, then the point x,y is within - // the polygon. - // - // This function is based on an original algorithm developed by R.Nierhaus. - - return (Int_t)TMath::IsInside(x,y,fNpoints,fX,fY); -} - - //______________________________________________________________________________ void TCutG::SavePrimitive(ostream &out, Option_t *option /*= ""*/) {