Of trees and stuff

[Άγγελος Οικονομόπουλος]

On Monday 16 December 2002 02:51, William Lee Irwin III wrote:
[...]
> My first thought is a length-constrained address minimization on a 2-d
> tree, quadtree, or 2D k-d-b tree keyed on address and length; the
> duelling tree solutions aren't really capable of providing O(lg(n))
> guarantees for address-ordered first fit (or implementing address-
> ordered first fit at all). I have no clue how to do this both
> nonrecursively and without frequently-dirtied temporary node linkage,
> though, as it appears to require a work stack (or potentially even a
> queue for prioritized searches) like many other graph searches. Also,
> I don't have a proof in hand that this is really O(lg(n)) worst-case,
> though there are relatively obvious intuitive reasons to suspect so.

ΟΚ, παραδίνομαι. ΤΙ ΣΤΟΝ ΚΟΡΑΚΑ είναι ένα 2d k-d-b δέντρο;

-- 
Make input easy to proofread.
            - The Elements of Programming Style (Kernighan & Plaugher)