|
| SDFSmoothIntersection2 (SDFNode2 *, SDFNode2 *, const double &) |
| Create a smooth intersection.
|
|
virtual | ~SDFSmoothIntersection2 () |
| Destructor.
|
|
double | Signed (const Vector2 &) const |
| Compute the signed distance.
|
|
QString | GetShader (PrimitiveManager *, std::list< QString > *, bool *) const |
| Compute the GLSL code to render the node.
|
|
virtual int | Memory () const |
| Return the size of a sub-tree.
|
|
virtual SDFNode2 * | Copy () const |
| Deep copy.
|
|
| SDFBinary2 (SDFNode2 *, SDFNode2 *) |
| Create a binary node2.
|
|
virtual | ~SDFBinary2 () |
| Recursively destroy the sub-trees.
|
|
int | Nodes () const |
| Compute the number of nodes in the sub-tree.
|
|
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 Vector2 &) |
| Compute the number of reccursive calls to Signed().
|
|
| SDFNode2 () |
| Create a generic node.
|
|
virtual | ~SDFNode2 () |
| Destructor.
|
|
virtual Vector2 | Gradient (const Vector2 &) const |
| Compute the gradient of the field.
|
|
virtual bool | Inside (const Vector2 &) const |
| Check if a point is inside or outside.
|
|
virtual QString | GetGradientShader (PrimitiveManager *, std::list< QString > *, bool *=nullptr) const |
| Compute the GLSL code to compute the gradient the sdf.
|
|
virtual double | K () const |
| Return the Lipschitz constant of the node.
|
|
Box2 | GetBox () const |
| Return the bounding box of the node.
|
|
Smooth intersection operator.
- Author
- Lucie Fournier