|
![](/i/fill.gif) |
OK, here is an what I am trying to optimize... Any ideas ?
I hope the sdl-code is not to obscure... I tried to keep it clean and
understandable, but I am no programmer, so it might be strange. If you
have any question, please ask.
TIA
Philippe
For reference purposes, I paste my original p.g post here :
"Philippe Debar" <phd### [at] yahoo fr> wrote in message
news:3BC### [at] yahoo fr...
> For once, I don't want to re-invent the wheel, so :
>
> I'd like to write a macro to replace a difference of boxes (plain
> vanilla box, no transform, not even translate) with a spacially
> equivalent union of boxes.
>
> (1) does it already exist ?
>
> if not
>
> (2) there are many possible solutions, how to find an optimal one ? And
> what would be optimum speed-wise ? (I guess less boxes, size
> irrevelant). I suppose this problem must have been studied already...
> Can anybody give me a link ?
>
>
> TIA
>
> Philippe
>
Post a reply to this message
Attachments:
Download 'DiffBox.pov.txt' (8 KB)
|
![](/i/fill.gif) |