computationally hard or not (algorithm question)

Frank Joerdens frank at
Sat Mar 24 08:45:24 PST 2001

On Fri, Mar 23, 2001 at 01:19:01PM -0800, Adam Getchell wrote:
> Hi Frank,
> I'm not an expert or anything, but I happen to have "Introduction to
> Algorithms" by Thomas Cormen, Charles Leiserson, and Ronald Rivest ("CLR"
> for short) and Chapter 35, Computational Geometry, might have what you're
> looking for.

Got that too :), this is where I found the 2D shortest-pair algorithm I

Thanks, Frank

More information about the Beowulf mailing list