You can subscribe to this list here.
2004 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}
(54) 

2005 
_{Jan}
(40) 
_{Feb}
(69) 
_{Mar}
(43) 
_{Apr}
(81) 
_{May}
(92) 
_{Jun}
(56) 
_{Jul}
(35) 
_{Aug}
(59) 
_{Sep}
(41) 
_{Oct}
(26) 
_{Nov}
(15) 
_{Dec}
(12) 
2006 
_{Jan}
(20) 
_{Feb}
(23) 
_{Mar}
(47) 
_{Apr}
(87) 
_{May}
(43) 
_{Jun}
(7) 
_{Jul}
(20) 
_{Aug}
(5) 
_{Sep}
(29) 
_{Oct}
(83) 
_{Nov}
(34) 
_{Dec}
(16) 
2007 
_{Jan}
(11) 
_{Feb}

_{Mar}

_{Apr}

_{May}
(4) 
_{Jun}
(2) 
_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

2008 
_{Jan}
(3) 
_{Feb}
(24) 
_{Mar}
(2) 
_{Apr}

_{May}
(1) 
_{Jun}

_{Jul}

_{Aug}
(4) 
_{Sep}
(8) 
_{Oct}
(2) 
_{Nov}
(1) 
_{Dec}

2009 
_{Jan}
(8) 
_{Feb}
(22) 
_{Mar}
(5) 
_{Apr}
(10) 
_{May}
(9) 
_{Jun}
(8) 
_{Jul}
(2) 
_{Aug}
(13) 
_{Sep}
(10) 
_{Oct}

_{Nov}

_{Dec}
(1) 
2010 
_{Jan}
(3) 
_{Feb}
(1) 
_{Mar}
(4) 
_{Apr}
(2) 
_{May}
(3) 
_{Jun}

_{Jul}
(1) 
_{Aug}

_{Sep}

_{Oct}
(2) 
_{Nov}

_{Dec}

2011 
_{Jan}

_{Feb}

_{Mar}

_{Apr}
(2) 
_{May}

_{Jun}

_{Jul}

_{Aug}
(2) 
_{Sep}

_{Oct}

_{Nov}
(7) 
_{Dec}

2012 
_{Jan}

_{Feb}

_{Mar}

_{Apr}
(3) 
_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}
(1) 
_{Oct}
(1) 
_{Nov}
(4) 
_{Dec}
(5) 
2013 
_{Jan}

_{Feb}
(5) 
_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 




1

2

3

4

5

6

7
(4) 
8

9

10

11

12

13
(1) 
14
(7) 
15
(6) 
16
(4) 
17
(1) 
18

19

20

21

22

23

24

25

26

27

28





From: Matthias Baas <mbaas@us...>  20060217 18:56:17

Update of /cvsroot/cgkit/cgkit2/cgkit In directory sc8prcvs1.sourceforge.net:/tmp/cvsserv20964/cgkit Added Files: hammersley.py Log Message: Added a module to create Hammersley and Halton points  NEW FILE: hammersley.py  ########################################################################### # cgkit  Python Computer Graphics Kit # Copyright (C) 2004 Matthias Baas (baas@...) # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 021111307 USA # # cgkit homepage: http://cgkit.sourceforge.net ########################################################################### # $Id: hammersley.py,v 1.1 2006/02/17 18:56:09 mbaas Exp $ """ Hammersley & Halton point generation This module contains functions to generate points that are uniformly distributed and stochasticlooking on either a unit square or a unit sphere. The Hammersley point set is more uniform but is nonhierarchical, i.e. for different n arguments you get an entirely new sequence. If you need hierarchical behavior you can use the Halton point set. This is a Python version of the implementation provided in: TienTsin Wong, WaiShing Luk, PhengAnn Heng "Sampling with Hammersley and Halton points" Journal of Graphics Tools, Vol. 2, No. 2, 1997, pp. 924 http://www.acm.org/jgt/papers/WongLukHeng97/ http://www.cse.cuhk.edu.hk/~ttwong/papers/udpoint/udpoints.html The original C versions of these functions are distributed under the following license: (c) Copyright 1997, TienTsin Wong ALL RIGHTS RESERVED Permission to use, copy, modify, and distribute this software for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both the copyright notice and this permission notice appear in supporting documentation, THE MATERIAL EMBODIED ON THIS SOFTWARE IS PROVIDED TO YOU "ASIS" AND WITHOUT WARRANTY OF ANY KIND, EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT SHALL THE AUTHOR BE LIABLE TO YOU OR ANYONE ELSE FOR ANY DIRECT, SPECIAL, INCIDENTAL, INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER, INCLUDING WITHOUT LIMITATION, LOSS OF PROFIT, LOSS OF USE, SAVINGS OR REVENUE, OR THE CLAIMS OF THIRD PARTIES, WHETHER OR NOT THE AUTHOR HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH LOSS, HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE POSSESSION, USE OR PERFORMANCE OF THIS SOFTWARE. """ from math import pi, sqrt, cos, sin from cgtypes import * # planeHammersley def planeHammersley(n): """Yields n Hammersley points on the unit square in the xy plane. This function yields a sequence of n tuples (x,y) which represent a point on the unit square. The sequence of points for a particular n is always the same. When n changes an entirely new sequence will be generated. This function uses a base of 2. """ for k in range(n): u = 0 p=0.5 kk = k while kk>0: if kk & 1: u += p p *= 0.5 kk >>= 1 v = (k+0.5)/n yield (u, v) # sphereHammersley def sphereHammersley(n): """Yields n Hammersley points on the unit sphere. This function yields n vec3 objects representing points on the unit sphere. The sequence of points for a particular n is always the same. When n changes an entirely new sequence will be generated. This function uses a base of 2. """ for k in range(n): t = 0 p = 0.5 kk = k while kk>0: if kk & 1: t += p p *= 0.5 kk >>= 1 t = 2.0*t  1.0 phi = (k+0.5)/n phirad = phi*2.0*pi st = sqrt(1.0t*t) yield vec3(st*cos(phirad), st*sin(phirad), t) # planeHalton def planeHalton(n=None, p2=3): """Yields a sequence of Halton points on the unit square in the xy plane. This function yields a sequence of two floats (x,y) which represent a point on the unit square. The number of points to generate is given by n. If n is set to None, an infinite number of points is generated and the caller has to make sure the loop stops by checking some other critera. The sequence of generated points is always the same, no matter what n is (i.e. the first n elements generated by the sequence planeHalton(n+1) is identical to the sequence planeHalton(n)). This function uses 2 as its first prime base whereas the second prime p2 (which must be a prime number) can be provided by the user. """ k = 0 while k+1!=n: u = 0 p = 0.5 kk = k while kk>0: if kk & 1: u += p p *= 0.5 kk >>= 1 v = 0 ip = 1.0/p2 p = ip kk = k while kk>0: a = kk % p2 if a!=0: v += a*p p *= ip kk = int(kk/p2) yield (u,v) k += 1 # sphereHalton def sphereHalton(n=None, p2=3): """Yields a sequence of Halton points on the unit sphere. This function yields a sequence of vec3 objects representing points on the unit sphere. The number of points to generate is given by n. If n is set to None, an infinite number of points is generated and the caller has to make sure the loop stops by checking some other critera. The sequence of generated points is always the same, no matter what n is (i.e. the first n elements generated by the sequence sphereHalton(n+1) is identical to the sequence sphereHalton(n)). This function uses 2 as its first prime base whereas the second base p2 (which must be a prime number) can be provided by the user. """ k = 0 while k+1!=n: t = 0 p = 0.5 kk = k while kk>0: if kk & 1: t += p p *= 0.5 kk >>= 1 t = 2.0*t  1.0 st = sqrt(1.0t*t) phi = 0 ip = 1.0/p2 p = ip kk = k while kk>0: a = kk % p2 if a!=0: phi += a*p p *= ip kk = int(kk/p2) phirad = phi*4.0*pi yield vec3(st*cos(phirad), st*sin(phirad), t) k += 1 