Geometry Panel
Mesh processing tools: booleans, remeshing, decimation, refinement, and geometric utilities.
Mesh Union
Boolean union of two closed meshes.
| Input | Nickname | Description |
|---|---|---|
| Mesh A | A | First closed mesh |
| Mesh B | B | Second closed mesh |
| Output | Nickname | Description |
|---|---|---|
| Mesh | M | Result mesh |
| Info | I | Operation info |
Mesh Difference
Boolean difference (A minus B) of two closed meshes.
| Input | Nickname | Description |
|---|---|---|
| Mesh A | A | Base mesh |
| Mesh B | B | Mesh to subtract |
| Output | Nickname | Description |
|---|---|---|
| Mesh | M | Result mesh |
| Info | I | Operation info |
Mesh Intersection
Boolean intersection of two closed meshes.
| Input | Nickname | Description |
|---|---|---|
| Mesh A | A | First closed mesh |
| Mesh B | B | Second closed mesh |
| Output | Nickname | Description |
|---|---|---|
| Mesh | M | Result mesh |
| Info | I | Operation info |
Adaptive TriRemesh
Adaptive surface remeshing with feature embedding. Accepts Mesh or Brep.
| Input | Nickname | Description | Default |
|---|---|---|---|
| Geometry | G | Mesh or Brep to remesh | — |
| Target Edge Length | L | Desired edge length | 1.0 |
| Iterations | It | Remeshing passes (more = cleaner mesh) | 5 |
| Attractor Points | AP | Points that attract finer resolution | — |
| Attractor Curves | AC | Curves that attract finer resolution | — |
| Feature Curves | FC | Curves embedded as required mesh edges | — |
| Feature Points | FP | Points embedded as required vertices | — |
| Cleanup | Cl | Extra unconstrained pass to improve quality near features | false |
| Min Edge Length | Min | Minimum edge length near attractors (0 = auto: Target × 0.3) | 0 |
| Max Edge Length | Max | Maximum edge length far from attractors (0 = auto: Target × 1.5) | 0 |
| Transition | Tr | How sharply edge length transitions near attractors (0 = smooth, 1 = sharp) | 0.0 |
| Falloff Radius | FR | Distance from attractors over which edge length transitions from Min to Max, in model units (0 = auto: half of geometry diagonal) | 0 |
| Curvature | C | Surface detail preservation (0 = none, 1 = maximum) | 0.5 |
| Output | Nickname | Description |
|---|---|---|
| Mesh | M | Remeshed result |
| Dual | D | Dual mesh of the remeshed result |
| Info | I | Remesh statistics |
Mesh Decimate
Decimate a closed mesh by reducing triangle count within a tolerance.
| Input | Nickname | Description |
|---|---|---|
| Mesh | M | Closed mesh to decimate |
| Tolerance | T | Simplification tolerance |
| Output | Nickname | Description |
|---|---|---|
| Mesh | M | Decimated mesh |
| Info | I | Operation info |
Mesh Refine
Subdivide and refine a closed mesh. First applies subdivision smoothing with tangent interpolation (preserving edges sharper than the angle threshold), then refines to a target edge length. Unlike Laplacian smoothing, this adds geometry and preserves volume.
| Input | Nickname | Description |
|---|---|---|
| Mesh | M | Closed mesh to refine |
| Sharp Angle | SA | Angle threshold for preserving sharp edges |
| Edge Length | EL | Target edge length |
| Output | Nickname | Description |
|---|---|---|
| Mesh | M | Refined mesh |
| Info | I | Operation info |
Fix Invalid Mesh
Attempt to repair an invalid mesh by cleaning vertices, faces, normals, and filling holes.
| Input | Nickname | Description |
|---|---|---|
| Mesh | M | Mesh to repair |
| Fill Holes | F | Fill holes in the mesh |
| Output | Nickname | Description |
|---|---|---|
| Mesh | M | Repaired mesh |
| Info | I | Repair status |
Minimum Bounding Box
Find the smallest-volume oriented bounding box for geometry.
| Input | Nickname | Description | Default |
|---|---|---|---|
| Geometry | G | Mesh, Brep, Curve, or Points | — |
| Union | U | true = one box for all, false = per item | true |
| Output | Nickname | Description |
|---|---|---|
| Box | B | Oriented bounding box |
| Plane XY | Pxy | Center plane (XY) |
| Plane YZ | Pyz | Center plane (YZ) |
| Plane XZ | Pxz | Center plane (XZ) |
| Volume | V | Box volume |
| X | X | X dimension |
| Y | Y | Y dimension |
| Z | Z | Z dimension |
| Center | C | Center point |
Edge Chain
Find chains of continuous edges on a Brep. Outputs only chains with 2+ edges. Useful for selecting edge sequences for fillet/chamfer operations.
| Input | Nickname | Description |
|---|---|---|
| Brep | B | Brep to analyze |
| Continuity | C | Continuity threshold for chaining edges (optional) |
| Output | Nickname | Description |
|---|---|---|
| Chain Curves | C | Connected curve chains (one branch per chain) |
| Chain Indices | I | Edge indices per chain (one branch per chain) |
| Count | N | Number of chains found |
Orient Up
Ensure planes have Z-axis pointing up and vectors have positive Z component.
| Input | Nickname | Description |
|---|---|---|
| Geometry | G | Plane or Vector3d to orient upward |
| Output | Nickname | Description |
|---|---|---|
| Geometry | G | Corrected plane or vector |
| Flipped | F | Whether the input was flipped |
Voronoi Relaxation
Lloyd's relaxation on 2D Voronoi diagrams with custom boundary curve and projection plane.
| Input | Nickname | Description | Default |
|---|---|---|---|
| Points | P | Seed points | — |
| Boundary | B | Closed boundary curve | — |
| Iterations | It | Number of relaxation steps | 10 |
| Plane | Pl | Projection plane | WorldXY |
| Output | Nickname | Description |
|---|---|---|
| Points | P | Relaxed point positions |
| Cells | C | Voronoi cell boundaries |