Overlap Polygons¶
Functionality¶
For every polygon of one object search intersection at other object.
Epsilon makes it harder to find intersaction. Based on BVHtree mathutils.bvhtree.
Inputs¶
| Mode | Input Name | type |
|---|---|---|
| All | Vert(A) | vertices |
| All | Poly(A) | polygons |
| All | Vert(B) | vertices |
| All | Poly(B) | polygons |
Parameters¶
| Mode | Description |
|---|---|
| all triangles | Boolean to work with triangles makes it faster to calculate |
| epsilon | float threashold for cut weak results |
Outputs¶
| Mode | Input Name | type |
|---|---|---|
| All | PolyIndex(A) | indices |
| All | PolyIndex(B) | indices |
| All | OverlapPoly(A) | polygons |
| All | OverlapPoly(B) | polygons |
Notes¶
pass