[GRASS5] Want GNU libavl ?

[Andrea Aime]

Mmm, I'm planning a full rewrite of s.voronoi, s.delaunay 
cause the original Fortune algorithm implementation is not
commented and a bit difficult to read, moreover comp. geom.
textbooks tend to give a sligtly different description of the
alghorithm... I need a priority queue and a balanced tree and
I was considering using the code available at www.purists.org
were also an AVL tree is available... 
Should we put togheter a little container library for GRASS
that could be statically linked into the executables? As far as
I remember a b-tree implementation is already in the GRASS cvs,
maybe a more complete library would be useful and could be included
in GRASS 5.1...
Best regards
Andrea Aime

----- Original Message ----- 
From: "Eric G. Miller" <egm2 at jps.net>
To: "GRASS5" <grass5 at grass.itc.it>
Sent: Monday, January 21, 2002 5:03 AM
Subject: [GRASS5] Want GNU libavl ?


> Working on the polygon simplification problem, I needed a balanced tree
> to get efficient (n log n) sorted insert/retrieval.  Anyway, I grabbed
> Ben Pfaff's libavl 2.0, and it is working out pretty nicely.
> 
> I was wondering if it isn't something we might not want to add to the
> GRASS repository (note: Ben writes the "library" is intended to be
> included in code directly rather than distributed as a shared library).
> It has some useful trees:  A binary search tree, an AVL tree, and a
> Red-Black tree (as well a some variants).  It also is ridiculously
> over documented (really comes as a book in CWEB format).
> 
> Anyway, I expect to include the AVL tree portion already, so ...?
> 
> URL:  http://www.msu.edu/~pfaffben/avl/
> 
> -- 
> Eric G. Miller <egm2 at jps.net>
> _______________________________________________
> grass5 mailing list
> grass5 at grass.itc.it
> http://grass.itc.it/mailman/listinfo/grass5