|
Signed Distance Fields 1.0
|
Binary nodes. More...
#include <sdf.h>
Public Member Functions | |
| 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 double | Signed (const Vector &) const |
| Compute the signed distance. | |
| virtual double | BID (const Vector &) const |
| Compute a lower bound of the signed distance. | |
| virtual Vector | Gradient (const Vector &) const |
| Compute the gradient of the field. | |
| virtual bool | Inside (const Vector &) const |
| Check if a point is inside or outside. | |
| virtual Color | GetColor (const Vector &) const |
| Computes the color. | |
| virtual int | Memory () const |
| Return the size of a sub-tree. | |
| virtual double | K () const |
| Return the Lipschitz constant of the node. | |
| Box | GetBox () const |
| Return the bounding box of the node. | |
| virtual QString | GetShader (PrimitiveManager *, std::list< QString > *, bool *=nullptr) const |
| Compute the GLSL code to render the node. | |
| virtual QString | GetGradientShader (PrimitiveManager *, std::list< QString > *, bool *=nullptr) const |
| Compute the GLSL code to compute the gradient the sdf. | |
| 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'. | |
| virtual void | ComputeCostBID (const Vector &) |
| Compute the number of reccursive calls to BID() and Signed(). | |
Protected Attributes | |
| 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. | |
Additional Inherited Members | |
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. | |
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. | |
Binary nodes.
Create a binary node.
| a,b | Sub-trees. |
|
virtual |
Compute the number of reccursive calls to Signed().
Reimplemented from SDFNode.
Reimplemented in SDFBEIS, and SDFInterpolation.
|
virtual |
Compute the GLSL code to compute the cost of a call to sdf.
Reimplemented from SDFNode.
Reimplemented in SDFBEIS, SDFDifferenceShell, SDFInterpolation, SDFIntersectionShell, SDFLod, SDFSmoothDifference, SDFSmoothUnion, and SDFUnion.
|
virtual |
Return the local Lipschitz constant.
By default, binary nodes return the maximum of the Lipschitz constant of their sub-trees.
| b | Box |
Reimplemented from SDFNode.
|
virtual |
Compute the number of nodes in the sub-tree.
Reimplemented from SDFNode.