[R] Greedy triangulation

Dan Bebber dan.bebber at plants.ox.ac.uk
Thu Sep 14 11:55:31 CEST 2006


Hello,

does anyone have code that will generate a greedy triangulation 
(triangulation that uses shortest non-overlapping edges) for a set of points 
in Euclidean space?

Thanks,
Dan Bebber
_______________________
Dr. Daniel P. Bebber
Department of Plant Sciences
University of Oxford
South Parks Road
Oxford OX1 3RB
UK
Tel. 01865 275060



More information about the R-help mailing list