Xref: utzoo sci.math:10385 comp.graphics:10567
Path: utzoo!attcan!uunet!mailrus!iuvax!rutgers!mcnc!thorin!homer.cs.unc.edu!leech
From: leech@homer.cs.unc.edu
Newsgroups: sci.math,comp.graphics
Subject: Voronoi diagrams on a non-planar surface
Keywords: Computational Geometry
Message-ID: <12858@thorin.cs.unc.edu>
Date: 22 Mar 90 18:21:57 GMT
Sender: news@thorin.cs.unc.edu
Reply-To: leech@homer.cs.unc.edu ()
Organization: University Of North Carolina, Chapel Hill
Lines: 11
Expires:
References:
Sender:
Followup-To:


    Does anyone have references to algorithms for constructing Voronoi
diagrams/Delaunay triangulations on a non-planar metric surface?  The
general case would be nice, but even a restricted case for a sphere
would be helpful.  Preparata does not talk about this, and it's
unclear how a divide-and conquer technique such as used in the plane
would work.
--
    Jon Leech (leech@cs.unc.edu)    __@/
    "I met a wonderful new man. He's fictional, but you can't have everything."
	- Cecelia, _The Purple Rose of Cairo_