From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,a9517107ce472fc7,start
X-Google-Attributes: gid103376,public
From: mikeg2@my-dejanews.com
Subject: geometric utilities
Date: 1998/06/03
Message-ID: <6l2lrq$2ck$1@nnrp1.dejanews.com>#1/1
X-Deja-AN: 359052631
X-Http-User-Agent: Mozilla/3.0 (Win95; U)
Organization: Deja News - The Leader in Internet Discussion
X-Article-Creation-Date: Wed Jun 03 05:10:19 1998 GMT
Newsgroups: comp.lang.ada
Date: 1998-06-03T00:00:00+00:00
List-Id: <comp.lang.ada>


Let me preface this by being very clear that I'm not
looking for a free ride on a homework assignment...

I'm trying to find some public domain Ada utilities
for some relatively common geometric problems - e.g.,
polygon area, polygon hull, point in polygon (in
particular), and polygon tesselation (I think that's
the spelling).  I've checked around in PAL and at the
AdaHome site, and not found anything.  Have been
trying to implement this with the aid of various
algorithms books, and, in fact, have pretty much
everything working - except point in polygon, which
doesn't keep the tesselation routine from working,
just keeps it from generating optimal solutions (i.e.,
fewest number of convex polygon partitions for a
non-convex polygon).

If anybody knows of or has some Ada code that does
this, please contact me:

  mike.glasgow@lmco.com
  (301) 640-2834

BTW, I have some C, C++, and Fortran versions - but
something just isn't coming out right in the translation
to Ada - the tricky part for point in polygon has to
do with edge vertices, and that's what's not working
for me.

Thanks.

-----== Posted via Deja News, The Leader in Internet Discussion ==-----
http://www.dejanews.com/   Now offering spam-free web-based newsreading