The online platform for Nest algorithm.
Given a square piece of material and some letters to be laser-cut:
We want to pack all the letters into the square, using as little material as possible. If a single square is not enough, we also want to minimize the number of squares used.
In the CNC world this is called "nesting", and software that does this is typically targeted at industrial customers and very expensive.
for more detail , please go to SVGNest
Also, i have some plane to modify the project. The project will be support DXF file. The SVG format available only for the preview. The project will be migrate to Kotlin fully or majority.
Fill free to create issues or pull requests. The main goal of the project is mainly free and open source solution for nesting problem. I try to find the way to compensate the price of cloud server. You Star of the project can help to apply to some open source program.
When one polygon is constructed , its default Rotation attr is 0 , which means we will fix it during our Nest Program.
We can set it as 4 and this polygon may rotate in 90°,180°,270°. If we set Rotation attr as N, this polygon may these
rotation angles (360/N) *k , k= 0,1,2,3,...N
Meanwhile you can use bid to help you identify the polygons. It is useful when we get nest result.
polygon.bid = id;
polygon.setRotation(4);For those hollow polgyons, Nest4J provides a simple way to express by 2d coordinate system. If one polygon is inside in another by their coordinates, the Nest4J will detact it automaticly.
Backend read me is here
