BFLVoronoiMaker.h

Go to the documentation of this file.

//                                                                   //
//authors: Costas Andreopoulos, Elias Athanasopoulos, George Tzanakos//
//                Physics Department, University of Athens           //
//                                                  October 28, 1999 //

//
//               __ INSERT _ DOCUMENTATION _ HERE __
//
//                                                      see NuMI-L-xxx  

#ifndef BFLVORONOIMAKER_H
#define BFLVORONOIMAKER_H

#include <iostream>
#include "TMath.h"
#include "TVector2.h"
#include "TObjArray.h"
#include "TObject.h"
#include "BField/TIntList.h"
//#include "BField/BFLNode.h"

const Float_t kAugmentedGrRadius = 1000000;
const Float_t kGensRadius        = kAugmentedGrRadius / 10;
const Int_t    BaseGeneratorID    = 4;

class BFLWingedEdge;
class BFLVorOperator;
class TIntList;
class BFLNode;
class BFLVtx;
class BFLPolyg;
class BFLEdge;

class BFLVoronoiMaker: public TObject
{
public:

  BFLVoronoiMaker(BFLWingedEdge * voronoi);
  ~BFLVoronoiMaker();
  
  void Make(void);

private:

  void IncreaseEntropy(void);
  void AddDistantGenerators(void);
  void  RemoveRefsToDeletedEdges(void);
  Int_t AddNewVtx(Int_t edge, Float_t xv, Float_t yv);    
  void AddNewPolyg(Int_t EdgeID);
  Int_t AddNewEdge(Int_t SVtxID, Int_t EVtxID,Int_t EdgeOfSVtx, Int_t EdgeOfEVtx);
  void WingedEdgePatch(void);
  void MergeDataStructures(void);
  Int_t GetAnotherEdgeAround(Int_t PolygID) const ;
  Int_t GuessNearestNeighbour(void) const;
  void SubstructureInit(void);
  void NewStructureInit(void);
  void MarkEdgesToDelete(void);
  void MarkVerticesToDelete(void);  
  void DeleteSubstructure(void);
  void Defrag(void); 
                               
  //virtual void SetCurrentPolygID(Int_t pid) { fCurrentPolygID = pid; }
  //virtual Int_t GetCurrentPolygID(void) const { return fCurrentPolygID; }

  virtual Int_t RandomToSorted(Int_t SlotAtRandom) const {
    return 3+fRandomToSorted->At(SlotAtRandom);
  } 
  virtual Int_t SortedToRandom(Int_t SlotAtSorted) const {
    return 3+fSortedToRandom->At(SlotAtSorted);
  } 

  virtual BFLVorOperator * GetVoronoiOperator(void) { return fOp; }

  Int_t fCurrentPolygID;
  Int_t fGenID;
  Long_t fN;
  BFLWingedEdge * fVor;
  BFLWingedEdge * fVorPatch;
  BFLVorOperator * fOp;
  TObjArray * fGenerators;
  TIntList * fRandomToSorted;
  TIntList * fSortedToRandom;
  TIntList * fEdgesToDelete;
  TIntList * fVerticesToDelete;
  TIntList * fNewEdgesTopology;
  TIntList * fNewVertices;
//
  Bool_t debug;
  Bool_t debug2;
  TObjArray * fBField;

  ClassDef(BFLVoronoiMaker,0)   // MINOS Voronoi diagram consuctor 
}; 

#endif

---