hugo@griggs.dartmouth.edu (Peter Su) (03/08/91)
Hi,
Being a grad. student interested in parallel geometric algorithms, I
foolishly implemented some code that constructs a data structure that
makes various kinds of geometric search problems easy to solve; things
like:
1) Planar point location
2) Rectangle intersection problems
3) Dominance counting
4) Constructing triangulations (not any special ones, like Delauney
triangulations) of simple polygons
My problem is that I've had no luck finding good, large test cases to
use in good performance analysis of the code. If there is anyone out
there in net land who thinks they might have an application for
something like this, I'd be real happy to talk to them.
BTW: The code is for the Connection Machine, and is pretty rough right
now. I haven't bothered to tune it, or clean it up much, due to a
perceived lack of applications.
Thanks,
Pete
hugo@sunapee.dartmouth.edu
--
=========================== MODERATOR ==============================
Steve Stevenson {steve,fpst}@hubcap.clemson.edu
Department of Computer Science, comp.parallel
Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabell