Logo ROOT   6.30.04
Reference Guide
 All Namespaces Files Pages
TGraphDelaunay.h
Go to the documentation of this file.
1 // @(#)root/hist:$Id: TGraphDelaunay.h,v 1.00
2 // Author: Olivier Couet, Luke Jones (Royal Holloway, University of London)
3 
4 /*************************************************************************
5  * Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. *
6  * All rights reserved. *
7  * *
8  * For the licensing terms see $ROOTSYS/LICENSE. *
9  * For the list of contributors see $ROOTSYS/README/CREDITS. *
10  *************************************************************************/
11 
12 #ifndef ROOT_TGraphDelaunay
13 #define ROOT_TGraphDelaunay
14 
15 
16 //////////////////////////////////////////////////////////////////////////
17 // //
18 // TGraphDelaunay //
19 // //
20 // This class uses the Delaunay triangles technique to interpolate and //
21 // render the data set. //
22 // //
23 //////////////////////////////////////////////////////////////////////////
24 
25 #include "TNamed.h"
26 
27 class TGraph2D;
28 class TView;
29 
30 class TGraphDelaunay : public TNamed {
31 
32 private:
33 
34  TGraphDelaunay(const TGraphDelaunay&); // Not implemented
35  TGraphDelaunay& operator=(const TGraphDelaunay&); // Not implemented
36 
37 protected:
38 
39  Int_t fNdt; ///<!Number of Delaunay triangles found
40  Int_t fNpoints; ///<!Number of data points in fGraph2D
41  Int_t fNhull; ///<!Number of points in the hull
42  Double_t *fX; ///<!Pointer to fGraph2D->fX
43  Double_t *fY; ///<!Pointer to fGraph2D->fY
44  Double_t *fZ; ///<!Pointer to fGraph2D->fZ
45  Double_t *fXN; ///<!fGraph2D vectors normalized of size fNpoints
46  Double_t *fYN; ///<!fGraph2D vectors normalized of size fNpoints
47  Double_t fXNmin; ///<!Minimum value of fXN
48  Double_t fXNmax; ///<!Maximum value of fXN
49  Double_t fYNmin; ///<!Minimum value of fYN
50  Double_t fYNmax; ///<!Maximum value of fYN
51  Double_t fXoffset; ///<!
52  Double_t fYoffset; ///<!Parameters used to normalize user data
53  Double_t fXScaleFactor; ///<!
54  Double_t fYScaleFactor; ///<!
55  Double_t fZout; ///<!Histogram bin height for points lying outside the convex hull
56  Double_t *fDist; ///<!Array used to order mass points by distance
57  Int_t fMaxIter; ///<!Maximum number of iterations to find Delaunay triangles
58  Int_t fTriedSize; ///<!Real size of the fxTried arrays
59  Int_t *fPTried; ///<!
60  Int_t *fNTried; ///<!Delaunay triangles storage of size fNdt
61  Int_t *fMTried; ///<!
62  Int_t *fHullPoints; ///<!Hull points of size fNhull
63  Int_t *fOrder; ///<!Array used to order mass points by distance
64  Bool_t fAllTri; ///<!True if FindAllTriangles() has been performed on fGraph2D
65  Bool_t fInit; ///<!True if CreateTrianglesDataStructure() and FindHull() have been performed
66  TGraph2D *fGraph2D; ///<!2D graph containing the user data
67 
68  void CreateTrianglesDataStructure();
69  Bool_t Enclose(Int_t T1, Int_t T2, Int_t T3, Int_t Ex) const;
70  void FileIt(Int_t P, Int_t N, Int_t M);
71  void FindHull();
72  Bool_t InHull(Int_t E, Int_t X) const;
73  Double_t InterpolateOnPlane(Int_t TI1, Int_t TI2, Int_t TI3, Int_t E) const;
74 
75 public:
76 
77  TGraphDelaunay();
78  TGraphDelaunay(TGraph2D *g);
79 
80  virtual ~TGraphDelaunay();
81 
82  Double_t ComputeZ(Double_t x, Double_t y);
83  void FindAllTriangles();
84  TGraph2D *GetGraph2D() const {return fGraph2D;}
85  Double_t GetMarginBinsContent() const {return fZout;}
86  Int_t GetNdt() const {return fNdt;}
87  Int_t *GetPTried() const {return fPTried;}
88  Int_t *GetNTried() const {return fNTried;}
89  Int_t *GetMTried() const {return fMTried;}
90  Double_t *GetXN() const {return fXN;}
91  Double_t *GetYN() const {return fYN;}
92  Double_t GetXNmin() const {return fXNmin;}
93  Double_t GetXNmax() const {return fXNmax;}
94  Double_t GetYNmin() const {return fYNmin;}
95  Double_t GetYNmax() const {return fYNmax;}
96  Double_t Interpolate(Double_t x, Double_t y);
97  void SetMaxIter(Int_t n=100000);
98  void SetMarginBinsContent(Double_t z=0.);
99 
100  ClassDef(TGraphDelaunay,1) // Delaunay triangulation
101 };
102 
103 #endif