shende@cis.udel.edu (Anil Shende) (03/19/91)
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? (the Voronoi
cell around P is the set of pts. in space that are closer to P than to
any other point in the set of discrete points)
If so, could you please email me references to such work. My email
address is shende@cis.udel.edu
Thanks.
Anil Shende
shende@cis.udel.eduandreess@mrlaxs.mrl.uiuc.edu (Marc Andreessen) (03/19/91)
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