Java-Gaming.org    
Featured games (79)
games approved by the League of Dukes
Games in Showcase (477)
Games in Android Showcase (107)
games submitted by our members
Games in WIP (535)
games currently in development
News: Read the Java Gaming Resources, or peek at the official Java tutorials
 
    Home     Help   Search   Login   Register   
Pages: [1]
  ignore  |  Print  
  Uniform feature points  (Read 3581 times)
0 Members and 1 Guest are viewing this topic.
Offline Wiki Duke

?





« Posted 2012-12-05 16:27:32 »

Main/Procedural content

STUB (YEAH, I'M MAKING LOTS OF THESE) TO REMIND MYSELF TO DO A WRITE-UP.

Uniform Feature Points


Let us imagine that we have a 100x100 meter field and in this field we what there to be, on average, two flowers per meter squared.  So we could create an array with 100x100x2 = 20,000 elements to explicitly store the positions of each flower.  Using a seeded uniform random number generator we could then fill the array with repeatable coordinates for each.  If we were to examine the placement of flowers we would notice that there would be regions with none and areas where they are clummped up.

1  
2  
3  
4  
5  
6  
7  
rng.setSeed(someValue);

for(int i=0; i<100*100*2; i++) {
  float x = 100*rng.nextFloat();
  float y = 100*rng.nextFloat();
  doMyFlower(x,y);
}

Now if were to examine each square meter (or some other regular chunk) and count the number of flowers it contains, then the "distribution" of the counts approaches the Poisson distribution (Wikipedia, MathWorld).

So instead of precomputing a explicit list of "features", the space in question can be broken down into parts. For each part one computes a poisson random number to determine the number of features inside it.

1  
2  
3  
4  
5  
6  
7  
8  
9  
10  
11  
12  
13  
14  
15  
16  
17  
18  
19  
20  
21  
22  
23  
24  
25  
26  
27  
28  
29  
30  
31  
// From Knuth, reasonable on modern machines for smallish
// means.  There are many ways this can be computed.
// eMean = exp(-mean)
public static final int poisson(float eMean)
{
  int   r = 1;
  float t = rng.nextFloat();
 
  while (t > eMean) {
    r++;
    t *= rng.nextFloat();
  }
  return r-1;
}

// Sketch below this point
private static final float FLOWER_POWER = (float)Math.exp(-2);

private void doSomeCellFlowerThing(...)
{
  rng.setSeed(hashOfThisCell);

  int num = poisson(FLOWER_POWER);

  for(int i=0; i<num; i++) {
    // coordinates local to the square meter in this example
   float x = rng.nextFloat();
    float y = rng.nextFloat();
    ...
  }
}


Assuming that the chosen hashing function does a reasonable job, then the "look" of the localized vs. global versions should be similar.  Up until now I've avoided too much techo-speak but some definitions are required.  All of the above rng.nextFloat() calls are assume to return a uniformly distributed random number on [0,1) which is the standard base contract for a uniform floating point result (actually the inclusion/exclusion of the end-points may vary, but I'm assuming the presented).  In probability a uniform distribution (Wikipedia, MathWorld) means that all results on the range are equally probable...like in a single fair die roll.  So in the examples above the 'x' coordinate of each flower is completely independent of 'y', which should be expected.  Moreover the coordinates of each flower is independent of any other.  This leads to the previously mentioned empty and clumpped up areas.  This result, like many from probability, is likely to seem counter-intuitive.  Most likely "uniform" will tend to invoke notions of uniformly (or evenly) covered areas.  This is a radially different notion of uniform as implies that all of the values are related to each other rather than independent.  Note that these two different notions of uniform approach one another as the number of features (or event) increase.
This wiki entry has had 2 revisions with contributions from 1 members. (more info)
Offline Danny02
« Reply #1 - Posted 2012-12-05 18:33:14 »

for things like this I really like the halton sequence

maxis did some nice things in spore with this(point 3 (http://www.cs.cmu.edu/~ajw/s2007/)

I did an implementation of this here: https://github.com/Danny02/DarwinsBox/tree/master/Util/src/main/java/darwin/util/math/halton
Offline Roquen
« Reply #2 - Posted 2012-12-05 18:51:56 »

quasi-random numbers do work pretty well...the complexity tends to be higher...unless I'm missing something.  The effect is different, but as long as it looks good...that's all that matters.
Games published by our own members! Check 'em out!
Legends of Yore - The Casual Retro Roguelike
Offline Danny02
« Reply #3 - Posted 2012-12-05 18:55:51 »

the halton sequence has some very nice deterministic properties which are explained very well in the linked presentation

i.e
while creating new elements of the sequence, the distribution is always "uniform"
Offline Roquen
« Reply #4 - Posted 2012-12-06 06:42:25 »

Basically the difference is that quasi-random will give better coverage, which is more regular...less clumps & empty areas.  Actually the wikipedia picture gives pretty good idea: http://en.wikipedia.org/wiki/Halton_sequence

Offline Best Username Ever

Junior Member





« Reply #5 - Posted 2012-12-06 19:24:51 »

Quote
So instead of precomputing a explict list of "features", the space in question can be broken down into parts. For each part one computes a poisson random number to determine the number of features inside it.

Then what? Once you know how many flowers are in a certain grid location, how do you distribute them within it? What do you do about edges and corners?
Offline Roquen
« Reply #6 - Posted 2012-12-06 19:34:54 »

They are uniformly distributed inside...I'm going to add some pseudo code for the example.  This is the technique that point-noise based functions (like cellular noise) is based on...for instance.
Offline Roquen
« Reply #7 - Posted 2012-12-06 21:56:43 »

Updated the text...does that answer you're question?
Offline Best Username Ever

Junior Member





« Reply #8 - Posted 2012-12-07 00:48:03 »

According to that code they are randomly distributed within a cell, not uniformly distributed inside of it. A group of four cells could potentially could have a greater density of flowers around their shared corner and much lower density everywhere else. The same could apply to edges with two cells. Within one cell, multiple flowers could clump together.

They need to be uniformly distributed with respect to other objects in the same cell as well as to those in neighboring cells.
Offline Roquen
« Reply #9 - Posted 2012-12-07 14:27:35 »

while creating new elements of the sequence, the distribution is always "uniform"

According to that code they are randomly distributed within a cell, not uniformly distributed inside of it.
...
They need to be uniformly distributed with respect to other objects in the same cell as well as to those in neighboring cells.

BUE & Danny02: you're both using a non-probability based notion of uniform or more specifically a uniform random process.  Added some text to deal with the notion of "uniform".

A group of four cells could potentially could have a greater density of flowers around their shared corner and much lower density everywhere else. The same could apply to edges with two cells. Within one cell, multiple flowers could clump together.
All these examples and opposite versions of them are likely and desirable.  It's exactly what's suppose to happen.  If you were to create two images with points, one globally and the other by breaking into parts and using poission and randomly choose to display one on the right and left...you shouldn't be able to identify which is which.  If you can, then the hashing isn't working.

The various test-suites of PRNG quality will perform many operations in the opposite direction from this.  Create a bunch of points in 'n' dimensions, then break that space up into various sized parts..count the number of contents inside each part and if the values don't approach the Poisson distribution, then it fails the test...the PRNG is not creating uniform random numbers in that number of dimensions.
Games published by our own members! Check 'em out!
Legends of Yore - The Casual Retro Roguelike
Offline Best Username Ever

Junior Member





« Reply #10 - Posted 2012-12-07 22:26:34 »

I see. You're talking about emulating a process where each point's location coordinates are selected at random with uniform probability. Not that the generated graphics look uniformly distributed. You had me confused when you were talking about the Halton sequence.

Or in other words, uniform like rolling a fair dice twice and plotting the values as x-y coordinates - but not uniform like a uniform distribution of points.
Pages: [1]
  ignore  |  Print  
 
 

 

Add your game by posting it in the WIP section,
or publish it in Showcase.

The first screenshot will be displayed as a thumbnail.

pw (37 views)
2014-07-24 01:59:36

Riven (38 views)
2014-07-23 21:16:32

Riven (26 views)
2014-07-23 21:07:15

Riven (28 views)
2014-07-23 20:56:16

ctomni231 (59 views)
2014-07-18 06:55:21

Zero Volt (50 views)
2014-07-17 23:47:54

danieldean (42 views)
2014-07-17 23:41:23

MustardPeter (44 views)
2014-07-16 23:30:00

Cero (60 views)
2014-07-16 00:42:17

Riven (57 views)
2014-07-14 18:02:53
HotSpot Options
by dleskov
2014-07-08 03:59:08

Java and Game Development Tutorials
by SwordsMiner
2014-06-14 00:58:24

Java and Game Development Tutorials
by SwordsMiner
2014-06-14 00:47:22

How do I start Java Game Development?
by ra4king
2014-05-17 11:13:37

HotSpot Options
by Roquen
2014-05-15 09:59:54

HotSpot Options
by Roquen
2014-05-06 15:03:10

Escape Analysis
by Roquen
2014-04-29 22:16:43

Experimental Toys
by Roquen
2014-04-28 13:24:22
java-gaming.org is not responsible for the content posted by its members, including references to external websites, and other references that may or may not have a relation with our primarily gaming and game production oriented community. inquiries and complaints can be sent via email to the info‑account of the company managing the website of java‑gaming.org
Powered by MySQL Powered by PHP Powered by SMF 1.1.18 | SMF © 2013, Simple Machines | Managed by Enhanced Four Valid XHTML 1.0! Valid CSS!