HDTenEightyP/NetNews huggingface dataset:
From: johnm@cajal.uoregon.edu (John Martin)
Newsgroups: sci.math.num-analysis
Subject: Wanted: Sonogram Generation Software
Date: 28 Sep 92 21:33:33 GMT
Article-I.D.: nntp.1992Sep28.213333.23514
Reply-To: johnm@cajal.uoregon.edu
Organization: Institute of Neuroscience, University of Oregon


Does anyone know of public-domain sonogram siftware that can run on Unix
boxen, or on DOS machines?  Please post or e-mail, and Thanks in advance!


-- 
John Martin                                        johnm@cajal.uoregon.edu
Institute of Neuroscience,   University of Oregon,    Eugene, OR,    97402
From: inlowm@cpva.saic.com
Newsgroups: sci.math.num-analysis
Subject: Re: "S" programming language
Date: 5 Oct 92 11:03:03 PST
Organization: Science Applications Int'l Corp./San Diego


  Statistical Sciences offers an enhancement of S, S-Plus, which
appears to be a very good implementation of S.  We are in the
process of purchasing it for our Sun.  You can contact them at

    Statistical Sciences, Inc.
    1700 Westlake Ave. N. Suite 500
    Seattle, WA  98109

    Tel:  (206) 283-8802
    Fax:  (206) 283-8691

You can also contact Sales Associate Joseph Eisenberg at

    joe@statsci.com or using the above numbers.

He was very helpful in getting info about their package.  If you
do contact him tell him I sent you.

Hope this is what you are looking for...
Mark Inlow
inlowm@jupiter.saic.com
(619) 546-6978

P.S.  According to their literature, S-Plus has full virtual/extended
memory support based on Phar Lap system.
Date: Tuesday, 6 Oct 1992 18:25:43 CET
Newsgroups: sci.math.num-analysis
From: mencarna@risc.uni-linz.ac.at (Mark J. Encarnacion)
Distribution: world
Organization: RISC, University of Linz, Austria
Subject: complex roots

Given a polynomial of degree n with complex coefficients, I need to compute
all n complex roots (multiple or otherwise) of this polynomials.  I tried
the code given in Numerical Recipes in C, pp. 280-282, which is supposed to
be a sure-fire technique.  However, for some polynomials (e.g. x^3 - 1) I get
wrong results.  Is it known that this code contains bugs?  If not, I must be
doing something wrong, although I used the code verbatim.  Any advice that will
help me write a C program that works will be appreciated.
Thanks,
Mark
Newsgroups: sci.math.num-analysis
From: yzhu@nairana.ee.mu.oz.au (Yan ZHU (yhua))
Subject: numerical factorization of very high degree polynomial
Organization: Electrical and Electronic - University of Melbourne 
Date: Mon, 5 Oct 1992 09:16:40 GMT

 
 I am trying to solve non-linear problem by LP method.
 And I am looking for an algorithm for the numerical
 factorization of very high degree (500th-800th) polynomials 
 with complex coefficients.

 Does anyone know where I can get such a routine which
 preferably is written in Fortran or C? 
 
 All the routines I know of seem to be written for real 
 valued coefficients and the degree of the polynomials
 is too low for me.(such as the routine in IMSL can't be
 used for the degree higher than 50th)
 
 Any pointer/help in this regard is highly appreciated.
 Even a list of references for implementation would be
 helpful.
 
 I am sorry if this is a trivial question.
 
 Please e-mail me at yzhu@mullian.ee.mu.oz.au
 
 Sincerely,
 yan Zhu
 
 

Newsgroups: sci.math.num-analysis
From: dlee@iti.gov.sg (Dennis Lee)
Subject: Softare sought for quadratic objective function
Organization: Information Technology Institute, National Computer Board, Singapore.
Distribution: na
Date: Sat, 3 Oct 1992 03:24:15 GMT

Would appreciate it if someone who knows how to get it send me email or
post an article on it.

TQ,
>Dennis.
From: ramezani@are.Berkeley.EDU (Cyrus A. Ramezani)
Newsgroups: sci.math.num-analysis
Subject: Non-Linear Optimization: help please.
Date: 26 Sep 92 19:18:19 GMT
Organization: UC Berkeley, Agr & Res Economics
NNTP-Posting-Host: are.berkeley.edu




I hope I am not posting to the wrong group or asking too obvious of a
question, but dear netters:

  I am trying to solve a simple non-linear optimization problem subject
to inequality constraint.  Are there any "canned" programs around that
one may use.  I would most appreciate any pointers or information about
FTP cites.  I have access to fortran and C as well as GAMS. Thank you
very much.

Cyrus.
From: DORN@dirac.physics.jmu.edu (Dr. Dorn Peterson)
Newsgroups: sci.math.num-analysis
Subject: "S" programing language?
Date: 3 Oct 92 15:12:45 GMT
Organization: JMU Physics Dept.
X-News-Reader: VMS NEWS 1.24

Does anyone know if a version of the programing language "S" is available
that would run on a 486 (i.e. under DOS, WIN3.1, or OS/2 v2).

"S" was developed at Bell Labs as a programing language/system for data
analysis.

Dorn Peterson
James Madison University
Harrisonburg, VA
Newsgroups: sci.math.num-analysis
From: dak@messua.informatik.rwth-aachen.de (David Kastrup)
Subject: Re: 2D random numbers
Organization: Rechnerbetrieb Informatik  /  RWTH Aachen
Date:  1 Oct 92 00:11:17 GMT

gfraenke@magnus.acs.ohio-state.edu (Gideon A Fraenkel) writes:

>In article <3638.9209301031@rfsparc.essex.ac.uk> jenum@essex.ac.uk (Mohamed Jenu M Z) writes:
>>
>>Hi netters, 
>>
>>Is it ok to generate a 2D Gaussian distribution (mean 0 and variance 1)
>>pseudorandom numbers from a 1D pseudorandom numbers (Gaussian, mean 0,
>>variance 1) by arranging them into rows and columns? Any advice is
>>greatly appreciated. 
>>
>>Jenu
>>
>>jenum@ossparc.essex.ac.uk


>What about the 2D distribution is supposed to be Gaussian?  If it's
>the norm -- the distance from the origin -- , then the answer to your
>question is no.  In general, the distribution of a function f(x,y) is
>calculated as
>         /
>  P(z) = | delta(z-f(x,y)) P(x)P(y) dxdy   .
>         /
>You can see that if x and y are Gaussian, then P(z) will be
>proportional to z times a Gaussian, which among other things goes to
>zero at the origin.
A two-dimensional Gaussian has probability just like usual Gaussian:
1/(variance * sqrt(2pi)) exp(-(x-mean)^2/(2 variance^2)),
only that mean and x are vectors, and their sqauring is a simple dot
product. So you can use 1D Gaussians perfectly, since something
like exp(-x^2-y^2) can be split into exp(-x^2)exp(-y^2) without problem.
Apart from the post before being wrong (considering Gaussians definition),
I do not understand it. Too bad.
Xref: sparky sci.math.num-analysis:2937 sci.math.stat:2071
From: wjs@re3sc139h.gmr.com
Newsgroups: sci.math.num-analysis,sci.math.stat
Subject: REQ: Random Number Generator in FORTRAN
Date: 6 Oct 92 13:40:20 GMT
Article-I.D.: rphroy.91303
Followup-To: sci.math.num-analysis
Distribution: usa
Organization: EDS Test Engineering

Our FORTRAN run-time library does not contain a random number
generator.  Does anyone know where I can find the source code to
a GOOD algorithm ? 

 Please respond by email.

			 Thanks, 

			 Walt Stuart   wjs@re3sc139h.gmr.com

			 EDS Test Engineering
			 GM Research Labs
			 Warren, Mi  
Newsgroups: sci.math.num-analysis
From: bartho@scsun.unige.ch (BARTHOLDI Paul)
Subject: Re: 2D random numbers
Organization: Observatoire de Geneve
Date: Fri, 2 Oct 1992 15:03:24 GMT


|> > ....
|> Since you want pairs of random numbers, you may find it more efficient to use the Box-Muller
|> scheme:
|>         x = sqrt(-2 log xi) cos(2 pi eta),  y = sqrt(-2 log xi) sin(2 pi eta),
|> where  xi, eta  are successive pseudorandom numbers uniformly distributed on (0,1).
|> (- unless you already have a more efficient Gaussian generator available)
|> 
|> David Handscomb (dch@comlab.ox.ac.uk)

There is a variant where you can also use the correlation between x and y, but I
can't find it back (shurely very easy to find, but ...)

If any one has it, could you post it too ?     Thanks.

Paul Bartholdi   (bartho@obs.unige.ch)
From: jenum@essex.ac.uk (Mohamed Jenu M Z)
Newsgroups: sci.math.num-analysis
Subject: 2D random numbers
Date: 30 Sep 92 10:31:28 GMT


Hi netters, 

Is it ok to generate a 2D Gaussian distribution (mean 0 and variance 1)
pseudorandom numbers from a 1D pseudorandom numbers (Gaussian, mean 0,
variance 1) by arranging them into rows and columns? Any advice is
greatly appreciated. 

Jenu

jenum@ossparc.essex.ac.uk
Newsgroups: sci.math.num-analysis
From: ecahill@vax1.tcd.ie
Subject: Algebraic Equations Wanted
Organization: Trinity College Dublin
Date: Fri, 2 Oct 1992 11:45:49 GMT

I would be grateful if someone could point me in the right direction with the
following query.

Is it possible to (easily) get hold of a test system of non-linear algebraic
equations for testing out a new algorithm for such problems. The system should
be non-sparse and should comprise of about 100 equations.

Many thanks a priori,

Eamonn Cahill                                     ecahill@vax1.tcd.ie
Hitachi Dublin Laboratory
From: kst@ecs.soton.ac.uk (Ken Thomas)
Newsgroups: sci.math.num-analysis
Subject: Re: Heun and Runge-Kutta
Date: 2 Oct 92 13:09:32 GMT

It is interesting in this respect to read the book by Henrici
(Discrete Variable ..) who refers to improved Euler and modified
Euler. 

Ken Thomas.
University of Southampton, UK
kst@uk.ac.soton.ecs
Newsgroups: sci.math.num-analysis
From: takriti@engin.umich.edu (samer Takriti)
Subject: A point in a polyhedron: in or out. Using Linear Programming
Date: Wed, 30 Sep 92 09:47:37 EDT
Organization: University of Michigan Engineering, Ann Arbor

I asked a couple of days ago on how to apply the method described
by Preparata and Shamos for a set of points in R^m, but I have not
received a single answer. It looks that the methods described in this
book can be applied to R^2 only. 
When somebody asked this question a while ago, I suggested using 
Linear Programming instead of "shooting" rays. A lot of people criticized
Linear Programming because "the complexity of the method described 
by Preparat and Shamos is O(n)". Well, solving a linear program with
three constraints and n variables is O(n). So, again, I insist that
using Linear Programming is better than "shooting rays" in the region
specially that it gives the representation of the given point in terms
of the corner points.
-Samer
From: ayoung@vax.oxford.ac.uk
Newsgroups: sci.math.num-analysis
Subject: Help!  Book recommendations?
Date: 2 Oct 92 08:55:21 GMT
Organization: Oxford University VAX 6620


 Can anyone recommend some good books on the follwing:

[1] importance sampling

[2] Gibbs sampling

[3] Simulated annealing

[4] Genetic algorithms

 I'm hoping to find something that (in addition to the maths) also discusses
and compares the merits of various algorithms for implementing each method.

 Thanks, Alan Y.
Newsgroups: sci.math.num-analysis
From: skg8286@tamuts.tamu.edu (Srihari Kumar Gangaraj)
Subject: GAMS Info needed
Organization: Texas A&M University, College Station
Date: Sat, 26 Sep 1992 18:37:10 GMT

I am looking for routines for global optimisation and I was informed that
GAMS package has something ''MINOS'' (I'm not sure about the spelling).
Could someone tell me more about this GAMS and what it has to offer in
global optimisation and also about the MINOS or whatever. Is there any ftp
site where I could look into for more info on GAMS ?
Thank You.
	
------------------------------------------------------------------------------

Srihari Gangaraj                                      Graduate Student
srihari@aero15.tamu.edu                               Aerospace Engg.
                                                      Texas A&M.TX77840 
------------------------------------------------------------------------------
Newsgroups: sci.math.num-analysis
From: anthonyb@ecr.mu.OZ.AU (Anthony_Edward BROCKWELL)
Subject: prime twins
Keywords: prime twin conjecture sieve
Organization: Dept. Of Engineering Computer Resources, Uni. Of Melbourne
Date: Tue, 6 Oct 1992 00:33:43 GMT


I just accidentally posted this without any subject filled in.
Hopefully some machine somewhere will have filtered it out.
If not, sorry about cluttering up the news with unlabeled articles.
Anyway, here is the article:


If anyone out there is interested in prime twins, I have
a method (similar to Eratosthene's sieve)
of generating them (which I can prove as well),

	Start with the prime number 5.
	Take j=the closest int to 5/6,and then eliminate multiples
	of 5 plus and minus j, i.e. 4,6,9,11,14,16,etc.

	Now continue with the next prime (7), so
	we eliminate mults of 7 plus and minus 1, i.e.
	6,8,13,15,20,22,etc.

	Now repeat with the next prime (11), so
	we eliminate mults of 11 plus and minus 2 (11/6 is closest to 2),
	i.e. 9,13,20,24,etc.

	and keep going forever ...

The numbers remaining 

	i.e. 1,2,3,5,7,10,12,...

correspond to exactly the set of all prime twins in the following manner:

	Take n*6-1 and n*6+1 and they form a prime twin,

so 1 gives 5,7
   2 gives 11,13,
  12 gives 71,73,
  etc.

Note:  The only prime twin this sieve does not leave is 3 and 5.

I have thought about using this to prove the prime twin conjecture
but I never seem to have the time to sit down and really think about it,
since I am not really a mathematician.
A first step might be to say instead of going through eliminating mults of
primes plus and minus j, to use 6n plus minus one instead of the primes.
This would eliminate a superset of the numbers eliminated above, and
if it could be shown that there were infinitely many integers left
after eliminating this superset, the prime twin conjecture would
be solved.

If anyone can use this info. (or if the prime twin conjecture has
already been solved and no one has told me), please let me know.

			
				Anthony Brockwell.
From: simardr@IRO.UMontreal.CA (Richard Simard)
Newsgroups: sci.math.num-analysis
Subject: Re: 2D Random Generators
Date: 28 Sep 92 16:28:35 GMT
Reply-To: simardr@IRO.UMontreal.CA (Richard Simard)
Organization: Universite de Montreal

why not generate 2 random numbers successively and
put them in a 2-d. vector?

--

from:  simardr@iro.umontreal.ca
Newsgroups: sci.math.num-analysis,sci.math.stat,sci.math
From: sarath@pender.ee.upenn.edu (P. Sarath Kumar)
Newsgroups: sci.math.num-analysis
Subject: Help: Gradient Optimization routine needed
Date: 28 Sep 92 14:17:41 GMT
Reply-To: sarath@pender.ee.upenn.edu (P. Sarath Kumar)
Followup-To: sarath@pender.ee.upenn.edu
Organization: University of Pennsylvania


Does anyone know of a gradient optimization routine which would minimize
f(x) where x and f are both complex valued vectors. f is non-linear.

All the routines I know of seem to be written for real valued functions.

Any help in this regard would be highly appreciated. Even a list of
references for implementation would be helpful.

I am sorry if this is a trivial question.

Sincerely,
Sarath.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
P. Sarath Kumar      314, Moore School, 200 S.33rd St., Philadelphia, PA19104.
		     Ph: Off (215)-898-4183.  Res: (215)-387-1880.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
From: dchatterjee@kuhub.cc.ukans.edu
Newsgroups: sci.math.num-analysis
Subject: Recommmendations needed on a book on Galerkin Methods
Date: 4 Oct 92 18:38:54 CDT
Organization: University of Kansas Academic Computing Services


Hello everybody who had a nice and not-so-nice weekend !
 
 How would you folks rate the following book:

 " Computational Galerkin Methods ", C.A.J Fletcher, Springer-Verlag, N.Y.,
   (Springer Series in Computational Physics), 1984, [ISBN: 0-387-12633-3 or
   3-540-12633-3].

 I have an additional question: is it worth buying the book ? (I work in the
 area of e.m. scattering and antenna theory - thus forcing me to look into
 analytic-based numerical methods or pure numerical/ analytical methods). I am
 asking the question because the book was published in 1984 and almost 9 years
 have passed, making it possible that other better books might be in place.
 Does anybody have any suggestions ?

 Please reply directly or post your suggestions on the group.

   Thanks in advance,

 - deb chatterjee
 e-mail: dchatterjee@kuhub.cc.ukans.edu












Newsgroups: sci.math.num-analysis
From: mek@jpl-devvax.jpl.nasa.gov (Mike Ketchmere)
Subject: Wanted: Implementation of an A-stable implicit Runge-Kutta method
Organization: Jet Propulsion Laboratory (NASA)
Distribution: na
Date: Tue, 6 Oct 1992 05:12:56 GMT

Subject line says it all.  Also looking for the code for ANY other implicit
methods which might be used to solve various stiff ODEs, besides the usual
BDF methods.  Thanks.

Mike
mek@thyme.jpl.nasa.gov
Newsgroups: sci.math.num-analysis
From: sullivan@teal.csn.org (Steve Sullivan)
Subject: Principle Components Analysis
Organization: Colorado SuperNet, Inc.
Distribution: na
Date: Fri, 2 Oct 1992 23:54:34 GMT


I'm interested in learning about principle components
analysis, but none of the profs I've talked to have
any references.

Can anyone recommend some good introductory books or
articles?

Many thanks in advance -

Steve Sullivan
sullivan@csn.org
From: jim@heart.seas.upenn.edu (Jim Streicher)
Newsgroups: sci.math.num-analysis
Subject: line of symmetry for shapes
Summary: need algorithm for line of sym of shapes
Keywords: symmetry
Date: 5 Oct 92 00:16:00 GMT
Followup-To: sci.math.num-analysis
Organization: :noitazinagrO


I have a question concerning the determination of
planar symmetry from two irregular "concentric" shapes.

An example of the two shapes might be ...


                         -------
                       /         \
                      /    ____   \_
                      |   /    \     \
                      /  |    _/     |
                     /   |   |       |
                    /    |___/   x    \ 
                    |           ______/
                     \____     /
                          \___/


In general, the shapes will not have a line of symmetry
such that one half of the shape is the mirror image of the other.

I need to find the "best" line of symmetry and quantify the error
based on some numerical algorithm.

The symmetry must be based on the mass between the concentric
shapes, (ie the area indicated with an 'x').


By eyeballing these shapes, I guess the line of sym should be drawn
like this:



                         -------
                       /         \
                      /    ____   \_
                      |   /    \     \
          ------------/--|----_/-----|------------ 
                     /   |   |       |
                    /    |___/   x    \ 
                    |           ______/
                     \____     /
                          \___/


Obviously, this may be way off, and I don't know how far off it is.


Does anyone know of a algorithm to determine the best line of symmetry?
Any thoughts on this problem?

---
Jim Streicher                                         (215) 898-8099
jim@heart.seas.upenn.edu (best)                       Dept. of Bioengineering
jim@thrombus.seas.upenn.edu (forwarded to heart)      U. of Penn.
streiche@eniac.seas.upenn.edu (forwarded to heart)    Philadelphia, PA. 19104


Organization: Doctoral student, Urban and Public Affairs, Carnegie Mellon, Pittsburgh, PA
Newsgroups: sci.math.num-analysis,sci.physics,sci.chem,sci.math
Date: Thu,  1 Oct 1992 17:30:44 -0400 
From: Lawrence Curcio <lc2b+@andrew.cmu.edu>
Subject: Re: Fitting nonlinear multivariate functions

SAS and SYSTAT both do general non-linear fitting. Both give default
criteria for finding the "Best Fit" and both allow you to enter your own
objective function. There are, for example, maximum likelihood methods,
minimum chisquare methods, and non-linear minimum squared error methods. 

Unlike simple linear methods, the fit you get out of one program, (or
even from one first guess) won't necessarily look like the fit you get
under other circumstances. It's also easy to accidentally specify a
model that cannot be identified. 

If the software doesn't give you what you're expecting, do some reading
or consult someone who has. 

Luck and Regards,
-LArry C.
Newsgroups: sci.math.num-analysis
From: takriti@engin.umich.edu (samer Takriti)
Subject: A point inside a polyhedron
Date: Mon, 28 Sep 92 16:41:50 EDT
Organization: University of Michigan Engineering, Ann Arbor

There was a question about checking whether a point is inside 
the convex hull of a given set of points or not. Some people
suggested using some methods that "shoot" a ray in order to
check whether the point is inside the hull or not. Can somebody
give the name of a reference(s) which describes this method ?
What is the complexity of such a method ? Can it be applied
in R^n ?
Thank you.
-Samer
Newsgroups: sci.math.num-analysis
From: ledwards@leland.Stanford.EDU (Laurence James Edwards)
Subject: Re: Points in Polygons
Organization: DSG, Stanford University, CA 94305, USA
Date: Thu, 1 Oct 92 23:35:15 GMT

In article <1992Oct1.082048.18478@dutrun2.tudelft.nl>, rcpshdb@dutrun2.tudelft.nl (Han de Bruijn) writes:
|> 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?

Duh, not, to bore people with this needless bickering but the point was that 10
years passed between the time Shamos first explicitly identified the field till
the time he co-wrote the book, plenty of time for others to write a book as
well.
 
|> > 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.

No kidding, the point was that the worst case analysis of algorithms for E^3
and up is not well developed. This was in '85 so it may have changed.

|> > 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" ...

Not really relevant to whether P&S is a good book on Computational Geometry.  I
won't argue with you if you say that worst case analysis is not the most
relevant of analysis techniques for all applications.

Larry Edwards
From: andrew@rentec.com (Andrew Mullhaupt)
Newsgroups: sci.math.num-analysis
Subject: Re: "S" programing language?
Date: 5 Oct 92 20:01:20 GMT
Organization: Renaissance Technologies Corp., Setauket, NY.

In article <1992Oct3.101245.2191@drycas.club.cc.cmu.edu> DORN@dirac.physics.jmu.edu (Dr. Dorn Peterson) writes:
>Does anyone know if a version of the programing language "S" is available

[for i486]

You can get a version of S-Plus for DOS from StatSci, Inc. Their phone
is 206-283-8802. Email for them is mktg@statsci.com.

Later,
Andrew Mullhaupt
From: dlee@iti.gov.sg (Dennis Lee)
Newsgroups: sci.math.num-analysis
Subject: Re:Software sought for quadratic objective function
Date: 5 Oct 92 03:37:58 GMT
Distribution: na
Organization: Information Technology Institute, National Computer Board, Singapore.

I am appending more info to my earlier article.

The specific algorithm for the Quad. Obj Function was developed by
Broyden-Fletcher-Shanno. 

Thanks for bandwidth,
>Dennis.
Newsgroups: sci.math.num-analysis
From: ledwards@leland.Stanford.EDU (Laurence James Edwards)
Subject: Re: Points in Polygons
Organization: DSG, Stanford University, CA 94305, USA
Date: Mon, 28 Sep 92 23:13:35 GMT

In article <1992Sep28.083843.23616@dutrun2.tudelft.nl>, rcpshdb@dutrun2.tudelft.nl (Han de Bruijn) writes:
|> In article <1992Sep27.022750.8620@leland.Stanford.EDU> Laurence James Edwards:
|> > Wow! I had forgotten what a godly book Preparata&Shamos is.
|> 
|> Bad taste.

Hmm, well I guess there's no accounting for taste...

While I wouldn't recommend it for recreational reading, Preparata&Shamos does
present a comprehensive and coherent account of computational geometry, and 
I think it is the first book devoted to the subject.

Larry Edwards