Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!samsung!sol.ctr.columbia.edu!cunixf.cc.columbia.edu!cs.columbia.edu!olasov
From: olasov@cs.columbia.edu (Benjamin Olasov)
Newsgroups: comp.graphics
Subject: random point list -> matrix
Message-ID: <1990Dec3.022752.4858@cs.columbia.edu>
Date: 3 Dec 90 02:27:52 GMT
Reply-To: olasov@cs.columbia.edu (Ben Olasov)
Followup-To: comp.graphics
Organization: none
Lines: 8

What's the most efficient algorithm for describing a random set
of points expressed as x,y,z coordinate triplets as an m x n matrix;
or if you prefer, a function which would take an arbitrarily long list
of random points as its argument, and return a matrix?

Thanks,

Ben