Re: [R] Greedy triangulation

From: Greg Snow <Greg.Snow_at_intermountainmail.org>
Date: Thu 14 Sep 2006 - 15:32:12 GMT


Does the deldir package do what you want?

-- 
Gregory (Greg) L. Snow Ph.D.
Statistical Data Center
Intermountain Healthcare
greg.snow@intermountainmail.org

(801) 408-8111
-----Original Message----- From: r-help-bounces@stat.math.ethz.ch [mailto:r-help-bounces@stat.math.ethz.ch] On Behalf Of Dan Bebber Sent: Thursday, September 14, 2006 3:56 AM To: r-help@stat.math.ethz.ch Subject: [R] Greedy triangulation 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 ______________________________________________ R-help@stat.math.ethz.ch mailing list https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide http://www.R-project.org/posting-guide.html and provide commented, minimal, self-contained, reproducible code. ______________________________________________ R-help@stat.math.ethz.ch mailing list https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide http://www.R-project.org/posting-guide.html and provide commented, minimal, self-contained, reproducible code.
Received on Fri Sep 15 01:37:13 2006

Archive maintained by Robert King, hosted by the discipline of statistics at the University of Newcastle, Australia.
Archive generated by hypermail 2.1.8, at Thu 14 Sep 2006 - 16:30:39 GMT.

Mailing list information is available at https://stat.ethz.ch/mailman/listinfo/r-help. Please read the posting guide before posting to the list.