[R] Greedy triangulation

[roger koenker]

Or, perhaps, tripack?

url:    www.econ.uiuc.edu/~roger            Roger Koenker
email    rkoenker at uiuc.edu            Department of Economics
vox:     217-333-4558                University of Illinois
fax:       217-244-6678                Champaign, IL 61820


On Sep 14, 2006, at 10:32 AM, Greg Snow wrote:

> Does the deldir package do what you want?
>
>
> --  
> Gregory (Greg) L. Snow Ph.D.
> Statistical Data Center
> Intermountain Healthcare
> greg.snow at intermountainmail.org
> (801) 408-8111
>
>
> -----Original Message-----
> From: r-help-bounces at stat.math.ethz.ch
> [mailto:r-help-bounces at stat.math.ethz.ch] On Behalf Of Dan Bebber
> Sent: Thursday, September 14, 2006 3:56 AM
> To: r-help at 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 at 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 at 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.