mode. Or
better, I should restudy the technique and learn it meself. Rrr.
Kirby
> -Original Message-
> From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On
> Behalf Of John Zelle
> Sent: Monday, October 10, 2005 2:42 PM
> To: edu-sig@python.org
> Subject: Re
Kirby,
Do you have a left and right stereo pair on that rendering? I just can't
make heads or tails of it w/o true 3D :-)
--John
Kirby Urner wrote:
>>I'll post again when I have more research behind me and either a solution
>>or concrete frustration in sight -- not before.
>>
>>Kirby
>
>
> OK
> I'll post again when I have more research behind me and either a solution
> or concrete frustration in sight -- not before.
>
> Kirby
OK, I've got a solution working. Here's an interim result:
http://www.4dsolutions.net/satacad/pythonicmath/connectorstudy2.jpg
Notice how the zigzag metal band
Kirby Urner wrote:
> I'm translating a volume 3 cube around in a 3D checkerboard, trying to flag
> all kitty-corner mid-edges (my bridge points), but not flagging border-line
> edges where the connector tabs shouldn't appear -- some large borg-like
> array of icosahedra connected by zig-zag tensed
On 10/9/05, Kirby Urner <[EMAIL PROTECTED]> wrote:
> I'll post again when I have more research behind me and either a solution or
> concrete frustration in sight -- not before.
I think you should just sort them by (x, y, z) and then comb through
the list looking for near-adjacent matches. Basicall
> Beware:
> 1.999 and 2.0001 likely won't lie in the same
> bin. You'll need to check neighbors for candidates, unless your fixed
> point stuff reflects an underlying granularity.
>
> -- Scott David Daniels
> [EMAIL PROTECTED]
Thanks for the heads up Scott.
I'm translat
Kirby Urner wrote:
> Talk about fishing for expert help!
>
> Thanks Guido.
>
> It's a pruning algorithm where I strip way pieces that don't meet up at
> (x,y,z) bridge points. Lots of symmetry about the origin so just pure
> distance won't work (not unique enough).
>
> I think might still g
Talk about fishing for expert help!
Thanks Guido.
It's a pruning algorithm where I strip way pieces that don't meet up at
(x,y,z) bridge points. Lots of symmetry about the origin so just pure
distance won't work (not unique enough).
I think might still get away with a tuple-indexed dict (t
Alas, you can't do that, and the problem isn't a deficiency of dicts,
but the fact that "almost equal" is not a transitive relationship.
Think about it. (Boy that brings back memories of math classes in
college, way, way, back, where a professor pointed this out casually
as an counter-illustration
So here's my situation. I have a set of XYZ tuples that'll come very close
to matching, most of them in pairs, but thanks to floating point, I can only
rely on "fuzzy equality" i.e. within a tolerance of say |e| per each x,y,z.
In other words, for all intents and purposes, I could consider (1.0,
10 matches
Mail list logo
