Newsgroups: sci.image.processing
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!udel!gatech!howland.reston.ans.net!spool.mu.edu!uwm.edu!biosci!parc!rocksanne!danis
From: danis@xis.xerox.com (Ronald Danisewicz)
Subject: C comp. geometry routines
Message-ID: <1994Nov9.172419.4770@news.wrc.xerox.com>
Originator: danis@torpor
Keywords: computational geometry, convex hull, minimum spanning tree
Sender: news@news.wrc.xerox.com
Organization: Xerox Imaging Systems, Inc.
Date: Wed, 9 Nov 1994 17:24:19 GMT
Lines: 20


I'm looking for an ftp site (or an individual who will send me code)
that has a C library of routines for computational geometry algortithms.

Specifically, I'm looking for the following routines :


	1)	compute a minimum euclidean spanning tree
		from a point set.

	2)	compute the vertices of a polygon that is the
		complex hull of a set of points.

Ideally I'd like really efficient ANSI C, but I'll take anything
I can get. 

I'm not a regular reader of this newsgroup, so it would be cool
if you could e-mail the info to me.

Thanks. 
