SDFIntersection Class Reference

Intersection operator. More...

#include <sdf.h>

Inheritance diagram for SDFIntersection:

Public Member Functions
	SDFIntersection (SDFNode *, SDFNode *)
	Create an intersection node.
	SDFIntersection (SDFNode *, SDFNode *, SDFNode *)
	Create an intersection node.
virtual	~SDFIntersection ()
	Destructor.
virtual double	Signed (const Vector &) const
	Compute the signed distance.
virtual Vector	Gradient (const Vector &) const
	Compute the gradient of the field.
double	BID (const Vector &) const
	Compute a lower bound of the signed distance.
void	ComputeCostBID (const Vector &)
	Compute the number of reccursive calls to BID() and Signed().
QString	GetShader (PrimitiveManager *, std::list< QString > *, bool *) const
	Compute the GLSL code to render the node.
QString	GetGradientShader (PrimitiveManager *, std::list< QString > *, bool *) const
	Compute the GLSL code to compute the gradient the sdf.
virtual int	Memory () const
	Return the size of a sub-tree.
virtual SDFNode *	Copy () const
	Deep copy.
Public Member Functions inherited from SDFBinary
	SDFBinary (SDFNode *, SDFNode *)
	Create a binary node.
virtual	~SDFBinary ()
	Recursively destroy the sub-trees.
virtual double	K (const Box &) const
	Return the local Lipschitz constant.
virtual QString	GetCostShader (PrimitiveManager *, std::list< QString > *, bool *) const
	Compute the GLSL code to compute the cost of a call to sdf.
virtual void	ComputeCostSigned (const Vector &)
	Compute the number of reccursive calls to Signed().
int	Nodes () const
	Compute the number of nodes in the sub-tree.
Public Member Functions inherited from SDFNode
	SDFNode ()
	Create a generic node.
virtual	~SDFNode ()
	Destructor.
virtual bool	Inside (const Vector &) const
	Check if a point is inside or outside.
virtual Color	GetColor (const Vector &) const
	Computes the color.
virtual double	K () const
	Return the Lipschitz constant of the node.
Box	GetBox () const
	Return the bounding box of the node.
virtual QString	GetMaterialShader (PrimitiveManager *, std::list< QString > *, bool *=nullptr) const
	Compute the GLSL code to compute the material the sdf at a given point 'p' with a given normal 'n'.

Static Public Member Functions
static double	Signed (const double &, const double &)
	Compute the difference between two distance field values.
Static Public Member Functions inherited from SDFNode
static void	ResetReccursiveCalls ()
	Reset the reccursive call property of the tree.
static int	ReccursiveCalls ()
	Returns the number of reccursive calls to Value() and BID().
static void	addReccursiveCalls (int)
	Add a nulber to the nbreccursiveCalls.
static SDFNode *	Stalactite (const Vector &p, const double &h, const double &r, bool noise=true, Random &random=Random::R239, const double &largeur=0.25, const double &espacement=0.61)
	Procedural parameterized stalactite.
static SDFNode *	SpherePieces ()
	Sphere carved, placed on a cylinder. Nice scene for testing sharp features reconstruction.

Additional Inherited Members
Protected Attributes inherited from SDFBinary
SDFNode *	e [2] = { nullptr,nullptr }
	Sub-trees.
Protected Attributes inherited from SDFNode
Box	box = Box::Infinity
	Box bounding the surface.
double	k = 1.0
	Lipschitz constant.
int	cost = 1
	Relative computation cost.
Static Protected Attributes inherited from SDFNode
static constexpr double	Epsilon = 0.01
	Small constant used for bounding volumes.
static int	reccursiveCalls = 0
	Recursive calls to BID or Value.

Detailed Description

Intersection operator.

Constructor & Destructor Documentation

SDFIntersection() [1/2]

SDFIntersection::SDFIntersection ( SDFNode * a, SDFNode * b )

explicit

Create an intersection node.

Parameters

a,b	Sub-trees.

SDFIntersection() [2/2]

SDFIntersection::SDFIntersection ( SDFNode * a, SDFNode * b, SDFNode * c )

explicit

Create an intersection node.

Parameters

a,b,c

Sub-trees.

Member Function Documentation

BID()

double SDFIntersection::BID ( const Vector & p ) const

virtual

Compute a lower bound of the signed distance.

The bound is not continuous, not even monotonous, but is faster to compute than the actual distance.

Author

Hubert-Brierre Pierre

Parameters

p

Point.

Reimplemented from SDFNode.

ComputeCostBID()

void SDFIntersection::ComputeCostBID ( const Vector & p )

virtual

Compute the number of reccursive calls to BID() and Signed().

Author

Hubert-Brierre Pierre

Reimplemented from SDFNode.

GetGradientShader()

QString SDFIntersection::GetGradientShader ( PrimitiveManager * primitives, std::list< QString > * dependency, bool * valid_glsl ) const

virtual

Compute the GLSL code to compute the gradient the sdf.

Author

HUEBRT-BRIERRE Pierre

Reimplemented from SDFNode.

GetShader()

QString SDFIntersection::GetShader ( PrimitiveManager * primitives, std::list< QString > * dependency, bool * valid_glsl ) const

virtual

Compute the GLSL code to render the node.

Author

Hubert-Brierre Pierre

Reimplemented from SDFNode.

Reimplemented in SDFIntersectionShell, and SDFSmoothIntersection.

Gradient()

Vector SDFIntersection::Gradient ( const Vector & p ) const

virtual

Compute the gradient of the field.

Parameters

p

Point.

Reimplemented from SDFNode.

Reimplemented in SDFSmoothIntersection.

Memory()

int SDFIntersection::Memory ( ) const

virtual

Return the size of a sub-tree.

Reimplemented from SDFNode.

Reimplemented in SDFIntersectionShell, and SDFSmoothIntersection.

Signed() [1/2]

double SDFIntersection::Signed ( const double & x, const double & y )

static

Compute the difference between two distance field values.

Parameters

x,y

Reals.

Signed() [2/2]

double SDFIntersection::Signed ( const Vector & p ) const

virtual

Compute the signed distance.

Parameters

p

Point.

Reimplemented from SDFNode.

Reimplemented in SDFIntersectionShell, and SDFSmoothIntersection.