Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!elroy.jpl.nasa.gov!swrinde!zaphod.mps.ohio-state.edu!caen!news.cs.indiana.edu!ux1.cso.uiuc.edu!mrlaxs.mrl.uiuc.edu!andreess
From: andreess@mrlaxs.mrl.uiuc.edu (Marc Andreessen)
Newsgroups: comp.graphics
Subject: Re: Curve drawing algorithms that use Voronoi cells
Message-ID: <1991Mar19.005255.28662@ux1.cso.uiuc.edu>
Date: 19 Mar 91 00:52:55 GMT
References: <48046@nigel.ee.udel.edu>
Sender: usenet@ux1.cso.uiuc.edu (News)
Organization: University of Illinois, Urbana
Lines: 15

In article <48046@nigel.ee.udel.edu> shende@cis.udel.edu (Anil Shende) writes:
>    Does anyone know of any curve drawing algorithms in 2, 3 or higher 
>    dimensions where the set of discrete points (perhaps on a grid) that
>    are chosen to represent the curve are exactly those points, P, so that
>    the curve passes through the Voronoi cell around P? [...]

Netlib has a Voronoi diagram/Delaunay triangulation program called 
'sweep2' available... send email to netlib@research.att.com with the
command 'send sweep2 from voronoi' as the message.

Marc

--
Marc Andreessen___________University of Illinois Materials Research Laboratory
Internet: andreessen@uimrl7.mrl.uiuc.edu____________Bitnet: andreessen@uiucmrl