Article View: sci.math.num-analysis
Article #694Re: Points in Polygons
From: Han de Bruijn
Date: Thu, 01 Oct 1992 08:20
Date: Thu, 01 Oct 1992 08:20
25 lines
1708 bytes
1708 bytes
In article <1992Sep30.221602.12539@leland.Stanford.EDU> Laurence James Edwards: > Well the term, Computational Geometry, was first applied to this > particular field of study in a 1975 paper by Shamos. The book is ... written by Shamos. Coincidence, huh? > For example, convex hull algorithms are generalized to n-dimensions, ... Yes. And I've seen much better treatments of this, Dijkstra for example. > little is known about point location problems in E^3 and higher dimensions. Huh? _MANY_ working implementations exist in F.E.M. postprocessing packages, as well as in "AVS", where I'm currently involved with. Somebody owes me an explanation. > Big oh worst case analysis does not always lead to algorithms well suited > for a particular application, the authors specifically admit that. Oh, I thought _Applied_ rules the roost in "sci.math.num-analysis" ... -- * 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
Technical Details
Message-ID:
<1992Oct1.082048.18478@dutrun2.tudelft.nl>Path:
arc1-ca.pugleaf.net!sparky!uunet!mcsun!sun4nl!dutrun!dutrun2!dutrun2!rcpshdbShow Full Headers
Complete Article Headers
Newsgroups: sci.math.num-analysis Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!sun4nl!dutrun!dutrun2!dutrun2!rcpshdb From: rcpshdb@dutrun2.tudelft.nl (Han de Bruijn) Subject: Re: Points in Polygons Message-ID: <1992Oct1.082048.18478@dutrun2.tudelft.nl> 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: Thu, 1 Oct 1992 08:20:48 GMT Lines: 25