RE: finding neighbors

Thread View: sci.math.num-analysis

2 messages

[T] Back to Threads [V] Tree View [G] Group Articles

2 total messages Started by Markus Kohler Fri, 14 Aug 1992 09:56

#434

Author: Markus Kohler
Date: Fri, 14 Aug 1992 09:56

10 lines
857 bytes


There's an algorithmus, which uses Voronoi-diagrams, which can find the nearest
neighbor of a given point in O(log(n)). You can find an example in the 
C++-bibliothek LEDA. You can can retrieve LEDA from nic.funet.fi (via anonymous
ftp) for example. In the USA you will find it too. 

Hope this will help you 

markus@alvws-1.dfki.uni-kl.de

NEED: LCRNG triplet selection methods?

#447

Author: Jan Steinman
Date: Mon, 17 Aug 1992 16:18

18 lines
1207 bytes

Are there simple techniques for choosing good paramaters for linear
congruential random number generators?

I need fast pseudo-random integers in different ranges. When I change
the modulus, the distribution developes "holes": integers that are
never hit. I tried differnt prime numbers for the multiplier and
increment, but that didn't help much.

(Yes, I'm sure Knuth has the answer, but my copy is 3,000 miles away!
I checked "Numerical Recipies", which basically poo-poos LCRNGs as
semi-useless, and refers the reader to Knuth.)

Please email, I'll summarize. Thanks!

--
: : Jan Steinman	   steinman@is.morgan.com		 Bytesmiths : :
: : 2002 Parkside Court				   West Linn, OR 97068-2767 : :
: : 503/657-7703					       212/956-8722 : :

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads