Xref: utzoo sci.math.num-analysis:611 comp.graphics:10290
Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!wuarchive!udel!princeton!phoenix!gauss!markv
From: markv@gauss.Princeton.EDU (Mark VandeWettering)
Newsgroups: sci.math.num-analysis,comp.graphics
Subject: Wanted: References for 3-D Delauney triangulations
Message-ID: <14389@phoenix.Princeton.EDU>
Date: 9 Mar 90 05:02:12 GMT
Sender: news@phoenix.Princeton.EDU
Reply-To: markv@gauss.Princeton.EDU ()
Followup-To: sci.math.num-analysis
Organization: Princeton University
Lines: 11


Allright, I give up.  I am not a topologist, nor do I play one on TV.
I want to construct a Delauney triangulation in three space, for a potentially
large (~50K) sites, and I wanna do it fast and neat, but mostly simply. 

Are there some shortcuts, or am I gonna half to go through every book 
on computational geometry in the world?  :-)   Send me your references.
Code will also be accepted, but I would prefer references.  (Can't debug
what you don't understand.)

Mark VandeWettering (markv@acm.princeton.edu)