[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"project-1525":3},{"id":4,"name":5,"fullName":6,"owner":7,"repo":5,"description":8,"homepage":9,"htmlUrl":10,"language":11,"languages":10,"totalLinesOfCode":10,"stars":12,"forks":13,"watchers":14,"openIssues":15,"contributorsCount":16,"subscribersCount":16,"size":16,"stars1d":17,"stars7d":18,"stars30d":19,"stars90d":16,"forks30d":16,"starsTrendScore":20,"compositeScore":21,"rankGlobal":10,"rankLanguage":10,"license":22,"archived":23,"fork":23,"defaultBranch":24,"hasWiki":25,"hasPages":23,"topics":26,"createdAt":10,"pushedAt":10,"updatedAt":47,"readmeContent":48,"aiSummary":49,"trendingCount":16,"starSnapshotCount":16,"syncStatus":50,"lastSyncTime":51,"discoverSource":52},1525,"polygon-packer","Flamethr0wer\u002Fpolygon-packer","Flamethr0wer","A powerful bin packing problem solver for any polygons","",null,"Python",277,20,3,1,0,8,15,73,24,3.97,"GNU General Public License v3.0",false,"main",true,[27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46],"2d","basin-hopping","bin-packing","bin-packing-problem","fast","geometry","math","mathematics","maths","minimization","minimizer","optimization","optimization-problem","packing","packing-algorithm","packing-algorithms","packing-problem","parametric","polygon","polygons","2026-06-12 02:00:29","# Flamethrower's polygon packer\nThis program can quickly solve the 2D bin packing problem for any number of any polygons inside any other polygon! It was the tool used to find all the optimal packings under the name \"Ignacio Vallejo\" on [Erich's Packing Center](https:\u002F\u002Ferich-friedman.github.io\u002Fpacking\u002F).\n\u003Cimg width=\"640\" height=\"480\" alt=\"30 triangles in a hexagon\" src=\"https:\u002F\u002Fgithub.com\u002Fuser-attachments\u002Fassets\u002F48591a93-3ed9-4031-9c42-8b6eb579d91e\" \u002F>\n\n### How to use\nDownload the python file, navigate to its location and run it like this:\n\n`python3 polygon_packer.py [n] [nsi] [nsc]`\n- Replace `[n]` with the number of inner polygons you want to solve for\n- Replace `[nsi]` with the number of sides of the inner polygons (e.g. 4 for a square)\n- Replace `[nsc]` with the number of sides of the container polygon\n\nOptional parameters:\n- `--attempts`: the total number of attempts to run. Increase to explore more possible packings. Defaults to 1000.\n- `--tolerance`: the tolerance for the penalty function. More penalty reduces the margin of overlap but limits exporation. Defaults to an empirical sweetspot of 0.00000001.\n- `--finalstep`: the container size is decreased by a smaller factor each time, to save compute at the beginning and achieve greater precision near the end. This sets the step size of the shrinkage which would correspond to the theoretical minimum container size (which, for most packings, will not actually be reached, so keep that in mind when setting this parameter). Defaults to 0.0001.\n","Flamethr0wer\u002Fpolygon-packer 是一个用于解决任意多边形的二维装箱问题的强大工具。该项目使用Python编写，核心功能是通过优化算法（如盆地跳跃法）来寻找在给定容器内放置多个指定多边形的最佳布局方案，支持自定义多边形数量、边数及容器形状等参数，并允许用户调整尝试次数、容忍度和最终步长等高级选项以平衡计算效率与结果精度。适用于需要高效利用空间布局的应用场景，比如物流仓储、图形设计等领域中的多边形排列优化问题。",2,"2026-06-11 02:44:29","CREATED_QUERY"]