Xref: utzoo comp.graphics:16670 comp.graphics.visualization:373
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!uwm.edu!linac,att!emory!wuarchive!udel!cis.udel.edu
From: shende@cis.udel.edu (Anil Shende)
Newsgroups: comp.graphics,comp.graphics.visualization
Subject: Curve drawing algorithms that use Voronoi cells
Message-ID: <48046@nigel.ee.udel.edu>
Date: 18 Mar 91 23:33:16 GMT
Sender: usenet@ee.udel.edu
Followup-To: comp.graphics
Organization: University of Delaware
Lines: 15
Nntp-Posting-Host: apollo.cis.udel.edu


    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.edu