home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky sci.math:17812 sci.astro:13752
- Newsgroups: sci.math,sci.astro
- Path: sparky!uunet!spool.mu.edu!caen!destroyer!cs.ubc.ca!uw-beaver!aberman
- From: aberman@cs.washington.edu (Andrew Berman)
- Subject: Algorithms for determining dimension of a set of points
- Message-ID: <1993Jan8.022545.10059@beaver.cs.washington.edu>
- Sender: news@beaver.cs.washington.edu (USENET News System)
- Organization: Computer Science & Engineering, U. of Washington, Seattle
- Date: Fri, 8 Jan 93 02:25:45 GMT
- Lines: 25
-
- I'm looking for info on algorithms to solve the following problem:
-
- Given a set of points in 3 space, what is the "dimension" of the shape
- represented by the points?
-
- Obviously, one could draw a squiggly line through all the points, or
- a bunch of planes, or put the whole thing in a cube, thus yielding 1,2
- or 3 dimensional answers. I'm looking for an algorithm which gives the
- most "reasonable" answer, i.e., if all the points lie on a line, I'd like
- the algorithm to pop out a "1".
-
- The set of points might be considered a random sampling from some manifold,
- for example.
-
- PLEASE E-MAIL, since I do not normally read either of these newsgroups.
-
- Thanks in advance,
-
- Andrew P. Berman
-
- --
- Andrew P. Berman | "I have no idea what White House statement was
- Dept. of Computer Science | was issued, but I stand by it 100 percent"
- University of Washington | -- Richard Darman
- aberman@cs.washington.edu |
-