add keywords for all nodes
This commit is contained in:
@@ -19,11 +19,11 @@ Fill masked (missing) regions by solving the Laplace equation with Dirichlet bou
|
||||
|
||||
| Name | Type | Default | Description |
|
||||
|------|------|---------|-------------|
|
||||
| iterations | INT | 500 | Number of Jacobi relaxation iterations; more iterations = smoother result (10–10000) |
|
||||
| iterations | INT | 500 | Number of Jacobi relaxation iterations; more iterations = smoother result (10-10000) |
|
||||
|
||||
## Notes
|
||||
|
||||
- Laplace interpolation produces the smoothest possible fill — it minimizes the integral of the squared gradient within the masked region.
|
||||
- For small holes (<50 px diameter), 200–500 iterations is usually sufficient. Larger holes may need 1000+.
|
||||
- For small holes (<50 px diameter), 200-500 iterations is usually sufficient. Larger holes may need 1000+.
|
||||
- Use a Draw Mask or Threshold Mask node to create the mask input.
|
||||
- For surfaces with texture, consider Fractal Interpolation instead, which preserves surface roughness characteristics.
|
||||
|
||||
Reference in New Issue
Block a user