![]() The circles wont be packed very well, so Kangaroo could be used to refine the result. 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 (). Then use the points in a voronoi and calculate the circles inscribed in voronoi cells. ![]() 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. 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. Post all questions on McNeel forum under OpenNest category or write me an email with attached files. dylib and you need to validate this file before use if you get security error. Windows Users: Please unblock the files if necessary and turn off Coff Settings.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |