markv@gauss.Princeton.EDU (Mark VandeWettering) (03/09/90)
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)