Go to file
Trammell Hudson b705626c01 two twists
2015-01-25 18:29:53 -05:00
Bunny-LowPoly.stl parse binary stl, merge vertices 2014-12-11 20:29:09 -05:00
dodecahedron-corner.scad dodecahedron test 2015-01-25 18:09:17 -05:00
dodecahedron.scad dodecahedron test 2015-01-25 18:09:17 -05:00
LICENSE.txt license 2014-12-25 23:08:44 +01:00
Makefile wireframe works, need to refactor to generate unique vertices 2015-01-25 13:01:34 -05:00
mobius-maker two twists 2015-01-25 18:29:53 -05:00
mobius-raw.stl generated 16-element mobius for testing 2015-01-04 11:12:13 -05:00
README.md features 2015-01-04 19:30:09 -05:00
stl-convert stl-convert ASCII to binary 2015-01-04 14:10:41 -05:00
test1.scad make unequal dimensions 2014-12-14 13:10:07 -05:00
test1.stl make unequal dimensions 2014-12-14 13:10:07 -05:00
test2.scad test2 sphere 2014-12-14 13:38:52 -05:00
test2.stl test2 sphere 2014-12-14 13:38:52 -05:00
test3.scad test hexagon cross 2014-12-31 13:32:44 +01:00
test3.stl test hexagon cross 2014-12-31 13:32:44 +01:00
unfold.c turn off labels 2015-01-04 14:59:47 -05:00
v3.h larger eps works, at what cost? 2015-01-25 18:09:47 -05:00
wireframe.c larger eps works, at what cost? 2015-01-25 18:09:47 -05:00

Unfolded sphere

unfold reads a binary STL file on standard input and generates a SVG that contains the triangles "folded flat" so that they can be laser cut. It will output multiple groups in the SVG file that will need to be re-arranged to fit on the laser cutter bed.

More info: https://trmm.net/Unfolding_STL

This is a work in progress -- it is not yet feature complete. Current features:

  • Collision detection works to build a non-overlapping set of triangles.

  • Coplanar triangles will be merged if possible.

  • Mountain/valley folds are marked. Dashed line means valley fold.

  • Starting face can be selected or randomly chosen; some produce better results than others.

  • stl-convert script can convert OpenSCAD ASCII STL files into binary STL files for unfold to process.

Among the features that it could use:

  • A better heuristic for finding the maximum non-overlaping set of triangles (Currently breadth-first search is used, with a slight preference for coplanar triangles)

  • Tabs for securing parts together.

  • Collapsing of very small or very thin triangles.