wow - we have a few open networks around here.
* skunkworks hugs his wpa
jepler: I suspect that gcode was generated programmatically
cradek: uh yeah
I wonder if both of those reports are from Stuart
the second one looks like it is due to the cinci reference
cradek: since I decided to rewrite my geometric primitives, i haven't managed to get line-line intersections right yet
* jepler smacks his forehead
* cradek laughs quietly at jepler
jepler: I think I have all the cases (that I intended to handle) working in emc
I bet there's something wrong here near the code that computes the intersections of lines and lines
there are actually lines and lines of line-line intersection code
I think the next step is to make all the other cases error
* jepler sits in the corner and whimpers
what'cha working on?
SWPadnos: I'm working on slightly more burly path offsetting; I had it mostly working, but then I decided to throw away my code and practically start over
oh. uh, cool :)
it will kick ass if you get it working
cvs up -R"last week" :)
[00:38:55] <jepler> http://emergent.unpy.net/index.cgi-files/sandbox/demo_comp.png
SWPadnos: yes, I do have version control and I did use it
here's a taste of what was working, except for a few bugs in intersection-finding ^^
did I get the command line right? (more or less)
-D"week ago" I think
oh I'm using git so I have no idea how to get the old version back out :-P
right, Date no Revision
hmmm. so what are all those shapes showing me?
ah, now I see
something like git checkout 4ee9da994ea82fa57847309c10bc411a3d37d63f
the funny thing is you're probably not kidding
how many segments does it look ahead - still one?
no, gotta be at least 2
SWPadnos: my code does a N^2 pass at the end to find loops
so, all of them
you could tune it so that it preserves some maximum number, e.g., 100
that's the gpl program we all want to have
if you're scared of the squares (and rightly so)
jepler: can you use my test cases (they're in gcode)
cradek: with some effort; I might want them in the future
I wonder if it would be very hard to make a sorted list of segments on the first pass through (un-offset) and then see if they intersect the tool shape based on distance / "hit-box" type math
right now it just has hardcoded paths in C++
I'm convinced you could do smarter loop detection than N^2
it would be based on sorting bounding boxes
if you don't see the problem in the code you're looking at, maybe it's on some line you're not looking at
yes - sort for geometric features (position and shape), rather than G-code sequence
there's also a way to do it to pixel accuracy with opengl, but this window is too narrow to contain the full answer
some fixed grid accuracy
I hope you don't have to resort to anything like that
I'd prefer "slow but right"
if I want to pocket a font and it takes an hour, I don't care one bit
or fast but right - that's OK too
openGL is fine for this, but the grid should be that of the highest resolution axis
which would make the memory demand pretty high
you could probably use a coarse grid and arrange it so that there are false positives but never false negatives .. then sort it out with "mathematically exact" intersections where there may exist intersections
but .. I'm not there yet
I have to write line-circle intersection again
I just realized something interesting.
finding the intersection of adjacent segments is just a special case of loop removal
I am what they call "the slow one"
I hope not
if so, then I'm the slug or something
SWPadnos_ is now known as SWPadnos
alex_joni: ray was on here last night wondering about how to test hardy
How you doing. Get out from under that last snow?
NO snow here.
We got the rain
We got some heavy snow.
hmmm. I guess this weekend on't be so nice here
here are the hardy packages that alex has been working on... You need to ask him about any issues.. I have only installed it once. http://dsplabs.cs.utt.ro/~juve/tempdebs/hardy/
It's probably headed your way, Steven
Ah thanks, skunkworks
I have to get the foam and tubes down for the garage floor - pouring monday.
Ah. Don't work to hard.
Ray: didn't you have a pdf on classic ladder - that you used in your classes?
Seems like it.
Thinking back it seems like it was a takeoff of the wiki page.
I'll see what I can find of it.
(more later) made a liar of me unless I get back to it.
I wonder if I knew what I was doing, near emccanon.cc:637
the more important question may be "do you now know what you were doing there?"
I can't see that the save does anything meaningful
I'm considering whether/how to add a canon call THE_NEXT_MOVE_SHOULD_BE_SEQUENCE_NUMBER(int n) or something like that
CVS must have different line numbers or something
oh - maybe not
[20:23:49] <cradek> http://timeguy.com/cradek-files/emc/t3.png
I bet everyone is sick of these pictures
No - they are cool
are the colors - g1 vs g2,3?
yeah AXIS does that - not new
huh - :)
they're so similar probably nobody ever noticed
I don't remember why I thought that was a good idea
I don't notice those things right away.. it takes a few yeares
I wonder if most controls let you move only Z with ccomp on
* skunkworks_ doesn't know..
cutter comp is new to me.
cradek: you mean jogging?
BigJohnT: no -- he is wondering if, with cutter comp on, a G1 that only moves Z acceptable
(because where exactly are you supposed to perform that Z motion?)
(at what X,Y position, that is)
jepler: got it
* cradek cluelessly tries to normalize a length by adding 2*pi to it
if your plunging down while cutting a pocket you have to use Z only
my Analim does cuttercomp during canned cycles and it does Z only moves...
ve7it is now known as LawrenceG