Hi Eli! I wrote: [...] > But back to Eli's question: If the data are sufficiently nice, then it > may be worth a try to join each data point with its two nearest > neighbours. Perhaps some hand work will be needed to adjust things, > but I don't think that there is any algorithm that is as good as the > human eye.
Hmph. I guess this was too simplistic. In particular, if your data points lie very dense, the "two nearest neighbours" approach would miserably fail. However, the more elaborate approach (have discs of radius r around your data points and choose r so that the overlapping discs are topologically a circle) might be worth a try. The notion for it is Rips complex, see http://en.wikipedia.org/wiki/Rips_complex Best regards, Simon -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
