home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky sci.math:9568 sci.math.num-analysis:2299
- Newsgroups: sci.math,sci.math.num-analysis
- Path: sparky!uunet!mcsun!sun4nl!dutrun!dutrun2!dutrun2!rcpshdb
- From: rcpshdb@dutrun2.tudelft.nl (Han de Bruijn)
- Subject: Triangulation
- Message-ID: <1992Jul27.064833.19391@dutrun2.tudelft.nl>
- Followup-To: sci.math.num-analysis
- Originator: rcpshdb@dutrun2.tudelft.nl
- Sender: news@dutrun2.tudelft.nl (UseNet News System)
- Nntp-Posting-Host: dutrun2.tudelft.nl
- Reply-To: rcpshdb@dutrun2.tudelft.nl (Han de Bruijn)
- Organization: Delft University of Technology
- Date: Mon, 27 Jul 1992 06:48:33 GMT
- Lines: 16
-
- Throw an arbitrary number of points at random in the plane.
-
- Does there exist an algorithm that _triangulates_ such an set of points;
- i.e. generates triangles in a "sensible" way, such that every point is a
- vertex of a triangle, and the triangles cover the whole area of points ?
-
- I've heard there exists something like "Kolgomorov triangulation".
- Has it to do with the above?
-
- "Sci.math" readers, please respond by e-mail or note the followup line,
- since I've become very picky in reading netnews.
- --
- * Han de Bruijn; Applications&Graphics | "A little bit of Physics * No
- * TUD Computing Centre; P.O. Box 354 | would be NO idleness in * Oil
- * 2600 AJ Delft; The Netherlands. | Mathematics" (HdB). * for
- * E-mail: Han.deBruijn@RC.TUDelft.NL --| Fax: +31 15 78 37 87 ----* Blood
-