HyperPlane Class Reference

#include <HyperPlane.h>

Inheritance diagram for HyperPlane:

Public Member Functions
	HyperPlane (const HyperPointSet &a)
virtual void	print (std::ostream &os=std::cout, int endline=1) const
bool	pointInPlane (const HyperPoint &hyperPoint) const
HyperPoint	findPlaneIntersectionParameters (const HyperPoint &hyperPoint, int dimToOmmit=0) const
HyperPoint	findIntersectionPoint (const HyperLine &hyperLine) const
HyperPoint	findLineIntersectionParameter (const HyperLine &hyperLine) const
HyperPoint	findPlaneIntersectionParameters (const HyperLine &hyperLine) const
TMatrixD	findIntersectionSolution (const HyperLine &hyperLine) const
bool	operator== (const HyperPlane &other) const
	~HyperPlane ()
Public Member Functions inherited from NPlane
	NPlane (const HyperPointSet &a)
	NPlane (const HyperPoint &origin, const HyperPointSet &v)
int	getDimension () const
int	getN () const
const HyperPoint &	getOrigin () const
virtual const HyperPoint &	getDirection (int i=0) const
HyperPoint	getParametricPoint (const HyperPoint &t) const
virtual	~NPlane ()

Additional Inherited Members
Protected Attributes inherited from NPlane
HyperPoint	_origin
HyperPointSet	_v

Detailed Description

HyperPlot, Author: Sam Harnew, sam.h.nosp@m.arne.nosp@m.w@gma.nosp@m.il.c.nosp@m.om , Date: Dec 2015

A HyperPlane that is defined by nDim points in space. i.e. a line in 2D, a plane in 3D ...

Definition at line 25 of file HyperPlane.h.

Constructor & Destructor Documentation

HyperPlane()

HyperPlane::HyperPlane

(

const HyperPointSet &

a

)

Constructor that requires nDim points to define the HyperPlane

Definition at line 7 of file HyperPlane.cpp.

                                             : 
  NPlane(a)
{ 
  WELCOME_LOG << "Hello from the HyperPlane() Constructor";

  if ( a.getDimension() < (int)a.size() ) ERROR_LOG << "You only need #dim points to define a hyperplane - I'll just use the first #dim";
  if ( a.getDimension() > (int)a.size() ) ERROR_LOG << "You have not provided enough points to define a hyperplane - I'll probably crash soon";

}

~HyperPlane()

HyperPlane::~HyperPlane

(

)

Definition at line 244 of file HyperPlane.cpp.

                        { 
  GOODBYE_LOG << "Goodbye from the HyperPlane() Constructor";
}

Member Function Documentation

findIntersectionPoint()

HyperPoint HyperPlane::findIntersectionPoint

(

const HyperLine &

hyperLine

)

const

Todo:

remember how this works

Definition at line 132 of file HyperPlane.cpp.

                                                                            {
  
  HyperPoint lineIntersectionParameter = findLineIntersectionParameter(hyperLine);

  if (lineIntersectionParameter.getDimension()==0) return lineIntersectionParameter;

  return hyperLine.getParametricPoint(lineIntersectionParameter.at(0));

}

findIntersectionSolution()

TMatrixD HyperPlane::findIntersectionSolution

(

const HyperLine &

hyperLine

)

const

Todo:

remember how this works

Definition at line 165 of file HyperPlane.cpp.

                                                                             {

  if (hyperLine.getDimension() != getDimension()){
    ERROR_LOG << "Your HyperPlane and HyperLine have different dimensionality. Returning 0";
    return TMatrixD(0,0);
  }

  int oldErrorLevel = gErrorIgnoreLevel;
  gErrorIgnoreLevel = 5000;

  HyperPoint lhs = hyperLine.getOrigin() - getOrigin();

  VERBOSE_LOG << "Making Column Vector";  
  TMatrixD vectorD(getDimension(), 1);

  for (int i = 0; i < getDimension(); i++){
    vectorD(i,0) = lhs.at(i);
  }

  VERBOSE_LOG << "Making Matrix";  
  TMatrixD matrix(getDimension(), getDimension());
  
  VERBOSE_LOG << "Filling Column 0"; 
  for (int i = 0; i < getDimension(); i++){
    matrix(i,0) = -hyperLine.getDirection().at(i);
  }

  for (int j = 1; j < getDimension(); j++){
    VERBOSE_LOG << "Filling Column " << j; 
    for (int i = 0; i < getDimension(); i++){
      matrix(i,j) = getDirection(j - 1).at(i);
    }
  }
  
  TDecompLU lu(matrix);
  if( !lu.Decompose() ) {
    VERBOSE_LOG << "Matrix is singular. Cannot find solution.";
    gErrorIgnoreLevel = oldErrorLevel;
    return TMatrixD(0,0);
  }

  VERBOSE_LOG << "Matrix before inversion";
  //if (_verbose) matrix.Print();

  double determinant = 0.0;
  matrix.Invert(&determinant);
  VERBOSE_LOG << "Determinant = " << determinant;

  VERBOSE_LOG << "Matrix after inversion";
  //if (_verbose) matrix.Print();

  TMatrixD result = matrix*vectorD;

  gErrorIgnoreLevel = oldErrorLevel;

  return result;

}

findLineIntersectionParameter()

HyperPoint HyperPlane::findLineIntersectionParameter

(

const HyperLine &

hyperLine

)

const

Todo:

remember how this works

Definition at line 142 of file HyperPlane.cpp.

                                                                                    {

  TMatrixD solution = findIntersectionSolution(hyperLine);
  if (solution.GetNcols() == 0) return HyperPoint(0);
  return HyperPoint(solution(0,0));

}

findPlaneIntersectionParameters() [1/2]

HyperPoint HyperPlane::findPlaneIntersectionParameters	(	const HyperPoint &	hyperPoint,
		int	dimToOmmit = 0
	)		const

Todo:

remember how this works

Definition at line 57 of file HyperPlane.cpp.

                                                                                                        {

  if (hyperPoint.getDimension() != getDimension()){
    ERROR_LOG << "Your HyperPlane and HyperPoint have different dimensionality. Returning 0";
    HyperPoint(0);
  }
  
  int oldErrorLevel = gErrorIgnoreLevel;
  gErrorIgnoreLevel = 5000;

  int dim = getDimension();
  int reducedDim = dim -1;

  std::vector<int> linIndep;
  for (int i = 0; i < dim; i++){
    if (dimToOmmit != i) linIndep.push_back(i);
  }

  HyperPoint lhs = hyperPoint - getOrigin();
 
  TMatrixD vectorD(reducedDim, 1);
  for (int i = 0; i < reducedDim ; i++){
    vectorD(i,0) = lhs.at(linIndep.at(i));
  }

  TMatrixD matrix(reducedDim, reducedDim);
  for (int j = 0; j < reducedDim; j++){
    for (int i = 0; i < reducedDim; i++){
      matrix(i,j) = getDirection(j).at(linIndep.at(i));
    }
  }
  
  TDecompLU lu(matrix);
  
  //std::cout << "getting eigenVectors" << std::endl;
  //TVectorT<double> eigenValues;
  //matrix.EigenVectors(eigenValues);
  //std::cout << "done" << std::endl;



  if( !lu.Decompose() ) {
    
    if (dimToOmmit != (dim -1)) return findPlaneIntersectionParameters(hyperPoint, dimToOmmit + 1);
    VERBOSE_LOG << "Matrix is singular. Cannot find solution.";
    matrix.Print();
    
    gErrorIgnoreLevel = oldErrorLevel;

    return HyperPoint(0);
  }

  VERBOSE_LOG << "Matrix before inversion";

  double determinant = 0.0;
  matrix.Invert(&determinant);
  VERBOSE_LOG << "Determinant = " << determinant;

  VERBOSE_LOG << "Matrix after inversion";

  TMatrixD result = matrix*vectorD;
  
  HyperPoint interceptionParameter(reducedDim);
  for (int i = 0; i < reducedDim; i++){
    interceptionParameter.at(i) = result(i,0);
  }

  VERBOSE_LOG << "All done - returning parameters";
   
  gErrorIgnoreLevel = oldErrorLevel;

  return interceptionParameter;

}

findPlaneIntersectionParameters() [2/2]

HyperPoint HyperPlane::findPlaneIntersectionParameters

(

const HyperLine &

hyperLine

)

const

Todo:

remember how this works

Definition at line 150 of file HyperPlane.cpp.

                                                                                      {

  TMatrixD solution = findIntersectionSolution(hyperLine);
  if (solution.GetNcols() == 0) return HyperPoint(0);

  HyperPoint point(getDimension() - 1);
  
  for (int i = 1; i < getDimension(); i++){
    point.at(i-1) = solution(i,0);
  }  

  return point;
  
}

operator==()

bool HyperPlane::operator==

(

const HyperPlane &

other

)

const

See if two planes are the same. Cannot just comapre the parameters. Instead see if the points that define plane A are within plane B.

Definition at line 227 of file HyperPlane.cpp.

                                                         {
  if (other.getDimension() != this->getDimension()) {
    ERROR_LOG << "Trying to compare HyperPlanes of different dimensions, returning false";
    return false; 
  }
  if ( this->pointInPlane(other.getOrigin()) == 0) return false;

  for (int i = 0; i < getDimension() - 1; i++){
    HyperPoint parameters(getDimension() - 1);
    parameters.at(i) = 1;
    HyperPoint pointInOtherPlane = other.getParametricPoint(parameters);
    if ( this->pointInPlane(pointInOtherPlane) == 0) return false;
  }
  return true;
}

pointInPlane()

bool HyperPlane::pointInPlane

(

const HyperPoint &

hyperPoint

)

const

Check to see if a point is within a HyperPlane. Distance between the two has to be smaller than sqrt(1e-2)

Definition at line 37 of file HyperPlane.cpp.

                                                               {
  
 
  HyperPoint interceptionParameters = findPlaneIntersectionParameters(hyperPoint);

  if (interceptionParameters.size() == 0) return false;
  HyperPoint pointInPlane           = getParametricPoint(interceptionParameters);
  
  HyperPoint vectorDifference = hyperPoint - pointInPlane;

  double difference = 0.0;
  for (int i = 0; i < getDimension(); i++) difference += fabs(vectorDifference.at(i));

  if( fabs(difference) < 1e-2 ) return true;
  
  return false;

}

print()

void HyperPlane::print ( std::ostream &  os = std::cout, int  endline = 1  ) const

virtual

Print the parameters that define the HyperPlane

Reimplemented from NPlane.

Definition at line 20 of file HyperPlane.cpp.

                                                       {

  os << "HyperPlane: v = ";
  _origin.print(os, 0);

  for (unsigned int i = 0; i < _v.size(); i++){
    os << " + ";
    _v.at(i).print(os, 0);
    os << "t_" << i;
  }
  if (endline) os << std::endl;

}

---

The documentation for this class was generated from the following files:

• Mint/HyperPlane.h
• src/Mojito/Chi2Test/HyperPlane.cpp