Anyone got a complex polygon they can share?

classic Classic list List threaded Threaded
5 messages Options
Reply | Threaded
Open this post in threaded view
|

Anyone got a complex polygon they can share?

MichaelAtOz
Administrator
I'm having trouble getting 2D multi-threads to run for long.

and/or a complex hulled 2D object.

Something that renders longer than a blink.
Admin - PM me if you need anything,
or if I've done something stupid...

Unless specifically shown otherwise above, my contribution is in the Public Domain; to the extent possible under law, I have waived all copyright and related or neighbouring rights to this work.
Obviously inclusion of works of previous authors is not included in the above.


The TPP is no simple “trade agreement.” Fight it! http://www.ourfairdeal.org/ time is running out!
Reply | Threaded
Open this post in threaded view
|

Re: Anyone got a complex polygon they can share?

Parkinbot
If it is a problem to find data at all, the multithread approach might be overkill.
Reply | Threaded
Open this post in threaded view
|

Re: Anyone got a complex polygon they can share?

Ronaldo
In reply to this post by MichaelAtOz
Fractals?

2017-04-17 4:51 GMT-03:00 MichaelAtOz <[hidden email]>:
I'm having trouble getting 2D multi-threads to run for long.

and/or a complex hulled 2D object.

Something that renders longer than a blink.



-----
Admin - PM me if you need anything, or if I've done something stupid...

Unless specifically shown otherwise above, my contribution is in the Public Domain; to the extent possible under law, I have waived all copyright and related or neighbouring rights to this work. Obviously inclusion of works of previous authors is not included in the above.

The TPP is no simple “trade agreement.”   Fight it! http://www.ourfairdeal.org/   time is running out!
--
View this message in context: http://forum.openscad.org/Anyone-got-a-complex-polygon-they-can-share-tp21257.html
Sent from the OpenSCAD mailing list archive at Nabble.com.

_______________________________________________
OpenSCAD mailing list
[hidden email]
http://lists.openscad.org/mailman/listinfo/discuss_lists.openscad.org


_______________________________________________
OpenSCAD mailing list
[hidden email]
http://lists.openscad.org/mailman/listinfo/discuss_lists.openscad.org
Reply | Threaded
Open this post in threaded view
|

Re: Anyone got a complex polygon they can share?

DanS
In reply to this post by MichaelAtOz
fractals are a good suggestion and you can get some ones that get weird fast if you throw in trig functions:


I have an openScad program that does just that but I seem to have some bugs in mine so the layers have gaps... and there are intersection problems...

On Mon, Apr 17, 2017 at 3:51 AM, MichaelAtOz <[hidden email]> wrote:
I'm having trouble getting 2D multi-threads to run for long.

and/or a complex hulled 2D object.

Something that renders longer than a blink.



-----
Admin - PM me if you need anything, or if I've done something stupid...

Unless specifically shown otherwise above, my contribution is in the Public Domain; to the extent possible under law, I have waived all copyright and related or neighbouring rights to this work. Obviously inclusion of works of previous authors is not included in the above.

The TPP is no simple “trade agreement.”   Fight it! http://www.ourfairdeal.org/   time is running out!
--
View this message in context: http://forum.openscad.org/Anyone-got-a-complex-polygon-they-can-share-tp21257.html
Sent from the OpenSCAD mailing list archive at Nabble.com.

_______________________________________________
OpenSCAD mailing list
[hidden email]
http://lists.openscad.org/mailman/listinfo/discuss_lists.openscad.org


_______________________________________________
OpenSCAD mailing list
[hidden email]
http://lists.openscad.org/mailman/listinfo/discuss_lists.openscad.org
Reply | Threaded
Open this post in threaded view
|

Re: Anyone got a complex polygon they can share?

Ronaldo
Don't need trigs. Sierpinski triangles grow exponentially, both in time and space, with base 3.

size = 10;
tri = size*[[0,0],[1,0],[1/2,1]];

module Sierpinsky(n=2) {
    if(n==0) polygon(tri);
    else scale(1/2) {
        translate(tri[0]) Sierpinsky(n-1);
        translate(tri[1]) Sierpinsky(n-1);
        translate(tri[2]) Sierpinsky(n-1);
    }
}
//hull()
Sierpinsky(9);



_______________________________________________
OpenSCAD mailing list
[hidden email]
http://lists.openscad.org/mailman/listinfo/discuss_lists.openscad.org