library: libRGL #include "TGLUtil.h" |
TGLPlane
class description - source file - inheritance tree (.pdf)
private:
void Normalise()
public:
Double_t A() const
TGLPlane()
TGLPlane(Double_t a, Double_t b, Double_t c, Double_t d, Bool_t norm = kTRUE)
TGLPlane(Double_t* eq, Bool_t norm = kTRUE)
TGLPlane(const TGLPlane&)
virtual ~TGLPlane()
Double_t* Arr()
Double_t B() const
Double_t C() const
const Double_t* CArr() const
static TClass* Class()
Double_t D() const
Double_t DistanceTo(const TGLVertex3& vertex) const
virtual TClass* IsA() const
TGLVertex3 NearestOn(const TGLVertex3& point) const
TGLVector3 Norm() const
TGLPlane& operator=(const TGLPlane&)
void Set(Double_t a, Double_t b, Double_t c, Double_t d, Bool_t norm = kTRUE)
void Set(Double_t* eq, Bool_t norm = kTRUE)
virtual void ShowMembers(TMemberInspector& insp, char* parent)
virtual void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
private:
Double_t fVals[4]
TGLPlane()
TGLPlane(Double_t a, Double_t b, Double_t c, Double_t d, Bool_t norm)
TGLPlane(Double_t eq[4], Bool_t norm)
~TGLPlane()
Inline Functions
void Normalise()
void Set(Double_t a, Double_t b, Double_t c, Double_t d, Bool_t norm = kTRUE)
void Set(Double_t* eq, Bool_t norm = kTRUE)
Double_t A() const
Double_t B() const
Double_t C() const
Double_t D() const
TGLVector3 Norm() const
Double_t DistanceTo(const TGLVertex3& vertex) const
TGLVertex3 NearestOn(const TGLVertex3& point) const
const Double_t* CArr() const
Double_t* Arr()
TClass* Class()
TClass* IsA() const
void ShowMembers(TMemberInspector& insp, char* parent)
void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
TGLPlane TGLPlane(const TGLPlane&)
TGLPlane& operator=(const TGLPlane&)
Author: Richard Maunder 25/05/2005
Last update: root/gl:$Name: $:$Id: TGLUtil.cxx,v 1.7 2005/06/15 10:22:57 brun Exp $
Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. *
ROOT page - Class index - Class Hierarchy - Top of the page
This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.