Timeline for Python: Bisect mesh into n parts, without separate 'LOOSE'
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 21, 2018 at 15:36 | vote | accept | Jip | ||
| Sep 21, 2018 at 15:36 | answer | added | Jip | timeline score: 5 | |
| Sep 21, 2018 at 15:09 | answer | added | batFINGER | timeline score: 6 | |
| Sep 21, 2018 at 14:25 | comment | added | batFINGER | Yes that would be one way. Or use something like left - right test to see if (say centroid) point of each split is between planes. Also there is a clear inner (or outer) on the bisect plane operator. Might be easier to step thru this way with each set of two planes. ie copy bmesh bisect clear inner on plane i, and outer on plane i+1 write to new mesh... for each section. example of clear outer | |
| Sep 21, 2018 at 14:09 | history | edited | Jip | CC BY-SA 4.0 | Added desire to name objects bisect-1, bisect-2 etc. Added code based on comment from batFINGER. |
| Sep 21, 2018 at 14:01 | comment | added | Jip | This is interesting! Code from first comment finds 36 islands. So how do I group these into 10 objects? I'd like to name them bisect-1, bisect-2 etc. Do you think I need this answer to make separate objects? | |
| Sep 21, 2018 at 13:32 | comment | added | batFINGER | Thought there was something familiar about this. After running your bisects, get the list of islands using code from comment above. Each island will belong to a bisect based on coords. There may be none, one or more islands per bisect. From there could split by selection, or (possibly simpler-ish) join the split objects that share verts in a bisect. | |
| Sep 21, 2018 at 13:02 | comment | added | batFINGER | Might find this answer useful. Instead of separating into new objects returns a dictionary of the islands. | |
| Sep 21, 2018 at 11:03 | history | asked | Jip | CC BY-SA 4.0 |