Grasshopper OpenNest
OpenNest – 2D Polyline Packing for fabrication such as laser or CNC cutting.
Related Lessons & Examples
Bin Packing Nesting
Circle Pack Mesh
Circular Joint1
Dendro Waffle
Image to Strips
Lloyd’s Voronoi relaxation
Mesh Paper Cut
Ngon HexDivide
Optimize Nesting
Paneling Fabrication
Parametric Cones
Parametric Wall
Plan Drafting
Radial Waffle Table
Rectangular Fractal Art
Text on Mesh
Voronoi Panels
Download OpenNest Plugin
OpenNest Plugin
OpenNest – 2D Polyline Packing for fabrication such as laser or CNC cutting.
OpenNest is Free. Free as “Free speech”, not as “Free coffee”. OpenNest can be supported: click here to buy me a coffee or beer. Developing and maintaining software takes time and resources (no magic here).
Examples: Before usage, download example files from this food4rhino page.
Tutorials: learn-visual-programming.com
Installation:
- Use Rhino 7 and Package Manager (Windows and Mac) or press first link below.
- Download the second (Windows) or third (mac) zipped files and place them in libraries folder You can open this folder when you open Grasshopper->File->Special Folder->Component Folder
Windows Users: Please unblock the files if necessary and turn off Coff Settings.
Mac Users: OpenNest employs C++ library .dylib and you need to validate this file before use if you get security error. Follow this instruction: link
Post all questions on McNeel forum under OpenNest category or write me an email with attached files.
The library is based on Boost 1.62 that is used to compute NFP – No Fit Polygon. The plug-in is located in Grasshopper: Params tab -> Nest Categary. I recommend to decrease tolerance to 0.01 in the main nesting component to achieve precise nesting output even it takes longer to compute. Also it is faster to nest low resolution polylines, and then apply transformation “T” output to moved detailed objects such as curves to nested shapes.
Implementation: translation from C++ to C# of a centroid for a closed polyline with or without holes: mapbox/polylabel: A fast algorithm for finding the pole of inaccessibility of a polygon (github.com).