<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms">
    <title>gmane.games.devel.algorithms</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms</link>
    <description/>
    <syn:updatePeriod>hourly</syn:updatePeriod>
    <syn:updateFrequency>1</syn:updateFrequency>
    <syn:updateBase>1901-01-01T00:00+00:00</syn:updateBase>
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22087"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22086"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22085"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22084"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22083"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22082"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22081"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22080"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22079"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22078"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22077"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22076"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22075"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22074"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22073"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22072"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22071"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22070"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22069"/>
        <rdf:li rdf:resource="http://permalink.gmane.org/gmane.games.devel.algorithms/22068"/>
      </rdf:Seq>
    </items>
    <image rdf:resource="http://gmane.org/img/gmane-25t.png"/>
    <textinput rdf:resource=""/>
  </channel>
  <image rdf:about="http://gmane.org/img/gmane-25t.png">
    <title>Gmane</title>
    <url>http://gmane.org/img/gmane-25t.png</url>
    <link>http://gmane.org</link>
  </image>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22087">
    <title>Re: Procedural scenes</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22087</link>
    <description>&lt;pre&gt;http://www.eamobile.com/bejeweled
This looks like Terragen to me.
http://www.planetside.co.uk/


On Sat, Apr 28, 2012 at 9:27 AM, Gino van den Bergen &amp;lt;
gino.vandenbergen&amp;lt; at &amp;gt;gmail.com&amp;gt; wrote:

------------------------------------------------------------------------------
Live Security Virtual Conference
Exclusive live event will cover all the ways today's security and 
threat landscape has changed and how IT managers can respond. Discussions 
will include endpoint security, mobile security and the latest in malware 
threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/_______________________________________________
GDAlgorithms-list mailing list
GDAlgorithms-list&amp;lt; at &amp;gt;lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list&lt;/pre&gt;</description>
    <dc:creator>Eric Chadwick</dc:creator>
    <dc:date>2012-04-28T13:58:47</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22086">
    <title>Re: Procedural scenes</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22086</link>
    <description>&lt;pre&gt;It could be Bryce: http://www.daz3d.com/i/products/bryce?

Op 28-4-2012 12:36, Jose Marin schreef:


&lt;/pre&gt;</description>
    <dc:creator>Gino van den Bergen</dc:creator>
    <dc:date>2012-04-28T13:27:58</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22085">
    <title>Re: Procedural scenes</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22085</link>
    <description>&lt;pre&gt; From a quick peek at screen shots on Google Images, I would say those 
backgrounds are hand drawn.

So the answer is: Photoshop.  Probably.


Jose Marin wrote:
------------------------------------------------------------------------------
Live Security Virtual Conference
Exclusive live event will cover all the ways today's security and 
threat landscape has changed and how IT managers can respond. Discussions 
will include endpoint security, mobile security and the latest in malware 
threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/_______________________________________________
GDAlgorithms-list mailing list
GDAlgorithms-list&amp;lt; at &amp;gt;lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list&lt;/pre&gt;</description>
    <dc:creator>James Robertson</dc:creator>
    <dc:date>2012-04-28T11:50:32</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22084">
    <title>Procedural scenes</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22084</link>
    <description>&lt;pre&gt;Hi.

Sorry for this OT, but I need to know from the experts.

Do you know which software generates backgrounds like in Bejeweled?

Thanks.

Jose------------------------------------------------------------------------------
Live Security Virtual Conference
Exclusive live event will cover all the ways today's security and 
threat landscape has changed and how IT managers can respond. Discussions 
will include endpoint security, mobile security and the latest in malware 
threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/_______________________________________________
GDAlgorithms-list mailing list
GDAlgorithms-list&amp;lt; at &amp;gt;lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list&lt;/pre&gt;</description>
    <dc:creator>Jose Marin</dc:creator>
    <dc:date>2012-04-28T10:36:57</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22083">
    <title>CFP - INTERNATIONAL JOURNAL OF ARTIFICIAL INTELLIGENCEAND EXPERT SYSTEMS (IJAE)</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22083</link>
    <description>&lt;pre&gt;
 
CALL FOR PAPERS - INTERNATIONAL JOURNAL OF ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS (IJAE)
ISSN: 2180-124X

Volume 3, Issue 3

Info. at http://www.cscjournals.org/csc/journals/IJAE/journal_cfp.php?JCode=IJAE

Computer Science Journals (CSC Journals) invites researchers, editors, scientists &amp;amp; scholars to publish their scientific research papers in an International Journal of Artificial Intelligence and Expert Systems (IJAE) Volume 3, Issue 3.

 

The main aim of the International Journal of Artificial Intelligence and Expert Systems (IJAE) is to provide a platform to AI &amp;amp; Expert Systems (ES) scientists and professionals to share their research and report new advances in the field of AI and ES. IJAE is a refereed journal producing well-written original research articles and studies, high quality papers as well as state-of-the-art surveys related to AI and ES. By establishing an effective channel of communication between theoretical researchers and practitioners, IJAE provides necessary support to practiti&lt;/pre&gt;</description>
    <dc:creator>J. Stewart</dc:creator>
    <dc:date>2012-02-29T20:38:07</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22082">
    <title>Re: CFP - INTERNATIONAL JOURNAL OF EXPERIMENTALALGORITHMS(IJEA)</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22082</link>
    <description>&lt;pre&gt;Oh, look, yet another questionable "academic" for-profit posting on
gd-algorithms!

This "international" journal should not be confused with the ACM "Journal
of Experimental Algorithms" (which has been going on for a long time.)

That being said -- while the quality of the ACM publication is much higher,
the politics and governance of the ACM has gotten so contrary to anything
reasonable that I stopped paying my dues...

Sincerely,

jw



--
Americans might object: there is no way we would sacrifice our living
standards for the benefit of people in the rest of the world. Nevertheless,
whether we get there willingly or not, we shall soon have lower consumption
rates, because our present rates are unsustainable.



On Tue, Feb 21, 2012 at 10:52 AM, J. Stewart &amp;lt;cfp&amp;lt; at &amp;gt;cscjournals.org&amp;gt; wrote:

------------------------------------------------------------------------------
Keep Your Developer Skills Current with LearnDevNow!
The most comprehensive online learning library for Microsoft developers
is just $99.99! Visua&lt;/pre&gt;</description>
    <dc:creator>Jon Watte</dc:creator>
    <dc:date>2012-02-21T21:26:23</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22081">
    <title>CFP - INTERNATIONAL JOURNAL OF EXPERIMENTALALGORITHMS(IJEA)</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22081</link>
    <description>&lt;pre&gt;

CALL FOR PAPERS - INTERNATIONAL JOURNAL OF EXPERIMENTAL ALGORITHMS (IJEA)
ISSN:  2180-1282

Volume 3, Issue 1
Info. at http://www.cscjournals.org/csc/journals/IJEA/journal_cfp.php?JCode=IJEA
 
Computer Science Journals (CSC Journals) invites researchers, editors, scientists &amp;amp; scholars to publish their scientific research papers in an International Journal of Experimental Algorithms (IJEA) Volume 3, Issue 1.

 

Experimental Algorithmics studies algorithms and data structures by joining experimental studies with the more traditional theoretical analyses. With this regard, the aim of The International Journal of Experimental Algorithms (IJEA) is (1) to stimulate research in algorithms based upon implementation and experimentation; in particular, to encourage testing, evaluation and reuse of complex theoretical algorithms and data structures; and (2) to distribute programs and testbeds throughout the research community and to provide a repository of useful programs and packages to both researchers and practit&lt;/pre&gt;</description>
    <dc:creator>J. Stewart</dc:creator>
    <dc:date>2012-02-21T18:52:28</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22080">
    <title>Re: Pick dominant light from sh coeffs</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22080</link>
    <description>&lt;pre&gt;So in layman's terms I am using these three http://imgur.com/oOddh coefficients
to derive the direction of the strongest light. Makes sense now.

That is much easier than I expected, thank you for taking the time to
explain it.

On Fri, Feb 3, 2012 at 10:21 AM, Peter-Pike Sloan &amp;lt;
peter_pike_sloan&amp;lt; at &amp;gt;hotmail.com&amp;gt; wrote:

------------------------------------------------------------------------------
Try before you buy = See our experts in action!
The most comprehensive online learning library for Microsoft developers
is just $99.99! Visual Studio, SharePoint, SQL - plus HTML5, CSS3, MVC3,
Metro Style Apps, more. Free future releases when you subscribe now!
http://p.sf.net/sfu/learndevnow-dev2_______________________________________________
GDAlgorithms-list mailing list
GDAlgorithms-list&amp;lt; at &amp;gt;lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list&lt;/pre&gt;</description>
    <dc:creator>Dan Treble</dc:creator>
    <dc:date>2012-02-03T01:28:09</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22079">
    <title>Re: Pick dominant light from sh coeffs</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22079</link>
    <description>&lt;pre&gt;
This is actually quite straightforward.
The optimal linear direction is -L[3],-L[1],L[3] - assuming the usual sign conventions, storage, etc.
where in your case L could be the luminance of the RGB SH vectors.
If you are using the coefficients from appendix 10, it turns out to be even simpler - it is just the .xyz coefficients after doing a luminance weighting of cAr/cAg/cAb.
That give you the direction. 
To generate the color of the light, you can simply evaluate the outgoing radiance using the above direction (as in the shader code in the appendix), and that's the color for the light (if illuminating a white material that is the light in the given direction that would give you the same diffuse response as the SH probe.)
See the section of the paper titled: "Extracting Conventional Lights from SH" on a technique to solve for both a colored directional light and an ambient light given SH coefficients, but if you are using the storage in appendix 10 it's a bit trickier since the DC term has been "polluted" by&lt;/pre&gt;</description>
    <dc:creator>Peter-Pike Sloan</dc:creator>
    <dc:date>2012-02-03T00:21:51</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22078">
    <title>Re: Pick dominant light from sh coeffs</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22078</link>
    <description>&lt;pre&gt;Looks like you want to normalize the 3d vector made from the basis
coefficients (-f[1,1], -f[1,-1], f[1,0]). Section 3.3 ZH Error Analysis
paragraph 2.

 

-= Dave

 

From: Dan Treble [mailto:daniel.treble&amp;lt; at &amp;gt;gmail.com] 
Sent: Thursday, February 02, 2012 3:22 PM
To: gdalgorithms-list&amp;lt; at &amp;gt;lists.sourceforge.net
Subject: [Algorithms] Pick dominant light from sh coeffs

 

I have 9 red, 9 green and 9 blue sh coefficients (packed using the
method in appendix 10 of
http://www.ppsloan.org/publications/StupidSH36.pdf).

 

I want to pick a single dominant light to use for specular. How would I
go about efficiently extracting the direction and color of that light
from the coefficients?

 

Looks like I need to calculate the "optimal linear direction" which is
supposedly in this paper
http://research.microsoft.com/en-us/um/people/johnsny/papers/ldprt.pdf,
however I can't see it. Worse still, if it is in there, it is probably
an integral that I will struggle to turn into code!

 

Thanks

 

Dan

 

 

----------------------&lt;/pre&gt;</description>
    <dc:creator>David Neubelt</dc:creator>
    <dc:date>2012-02-02T23:54:11</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22077">
    <title>Pick dominant light from sh coeffs</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22077</link>
    <description>&lt;pre&gt;I have 9 red, 9 green and 9 blue sh coefficients (packed using the method
in appendix 10 of http://www.ppsloan.org/publications/StupidSH36.pdf).

I want to pick a single dominant light to use for specular. How would I go
about efficiently extracting the direction and color of that light from the
coefficients?

Looks like I need to calculate the "optimal linear direction" which is
supposedly in this paper
http://research.microsoft.com/en-us/um/people/johnsny/papers/ldprt.pdf, however
I can't see it. Worse still, if it is in there, it is probably an integral
that I will struggle to turn into code!

Thanks

Dan
------------------------------------------------------------------------------
Keep Your Developer Skills Current with LearnDevNow!
The most comprehensive online learning library for Microsoft developers
is just $99.99! Visual Studio, SharePoint, SQL - plus HTML5, CSS3, MVC3,
Metro Style Apps, more. Free future releases when you subscribe now!
http://p.sf.net/sfu/learndevnow-d2d__________________________&lt;/pre&gt;</description>
    <dc:creator>Dan Treble</dc:creator>
    <dc:date>2012-02-02T23:22:21</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22076">
    <title>Invitation to connect on LinkedIn</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22076</link>
    <description>&lt;pre&gt;Game,

I'd like to add you to my professional network on LinkedIn.

- Alias

Alias  Cummins
Flash Developer at British Sky Broadcasting
London, United Kingdom

Confirm that you know Alias  Cummins:
https://www.linkedin.com/e/-caiq50-gu9y5gvy-21/isd/4714277300/g4NacFFU/?hs=false&amp;amp;tok=1UYmo2ATY7E4Y1

--
You are receiving Invitation to Connect emails. Click to unsubscribe:
http://www.linkedin.com/e/-caiq50-gu9y5gvy-21/vd2FeDxkP4APUWasKIabTDRQNsGTx7UvyaaqfJbkofG7TDZ4zr2kCIk_4q/goo/gdalgorithms-list%40lists%2Esourceforge%2Enet/20061/I1638194565_1/?hs=false&amp;amp;tok=2e_uF1AL07E4Y1

(c) 2011 LinkedIn Corporation. 2029 Stierlin Ct, Mountain View, CA 94043, USA.
------------------------------------------------------------------------------
The demand for IT networking professionals continues to grow, and the
demand for specialized networking skills is growing even more rapidly.
Take a complimentary Learning&amp;lt; at &amp;gt;Cisco Self-Assessment and learn 
about Cisco certifications, training, and career opportunities. 
http://p.sf.net/sfu&lt;/pre&gt;</description>
    <dc:creator>Alias Cummins</dc:creator>
    <dc:date>2011-10-27T16:07:33</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22075">
    <title>marcsh wants questions from you on Formspring</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22075</link>
    <description>&lt;pre&gt;Hi Game Development Algorithms,
marcsh invites you to get to know friends better on Formspring. Once you join, you'll be able to ask and respond to fun questions like this one:

What makes you laugh?

Join marcsh on Formspring

http://www.formspring.me/marcsh?utm_medium=email&amp;amp;utm_source=email&amp;amp;utm_campaign=invite&amp;amp;type=google&amp;amp;inviter=/Rkwh+WTTa8=


----------------------------------------

=====
To stop all email from Formspring immediately, click on the link below:
http://www.formspring.me/site/unsubscribe/?email=FYWW0A%2BQdIwD86e%2B%2FF7D3nMoE96x2WAkG%2FB4JXLTeFCbDIi42QRHmg%3D%3D
------------------------------------------------------------------------------
The demand for IT networking professionals continues to grow, and the
demand for specialized networking skills is growing even more rapidly.
Take a complimentary Learning&amp;lt; at &amp;gt;Cisco Self-Assessment and learn 
about Cisco certifications, training, and career opportunities. 
http://p.sf.net/sfu/cisco-dev2dev_______________________________________________
GDAlgor&lt;/pre&gt;</description>
    <dc:creator>marcsh</dc:creator>
    <dc:date>2011-10-23T00:20:24</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22074">
    <title>Re: procedural star graph generator</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22074</link>
    <description>&lt;pre&gt;
The graph theoretic version of star graphs is trivial! You just have N 
vertices and N-1 edges. One vertex is in the "center" (suppose without 
loss of generality it's the first one) and then the edges are {1,i} with 
2 &amp;lt;= i &amp;lt;= N. "Procedurally generating" such a graph is a single for loop!

Considering your reference to cellular textures, what you probably mean 
are Voronoi diagrams:

   http://en.wikipedia.org/wiki/Voronoi_diagram

If so, there's (reasonably well-known) algorithms for generating it from 
a set of points. The complexity of both the algorithms and 
implementation depends considerably on your requirements; if you just 
need a solution for a low number of points in the plane, that can be 
done with relatively little code. Higher dimensions require more work, 
and algorithms with optimal O(n log n) complexity (this is a lower bound 
for the complexity of algorithms that determine planar Voronoi 
diagrams!) are more involved than O(n^2) or worse algorithms.

-Fabian

---------------------------&lt;/pre&gt;</description>
    <dc:creator>Fabian Giesen</dc:creator>
    <dc:date>2011-09-10T08:51:13</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22073">
    <title>Re: procedural star graph generator</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22073</link>
    <description>&lt;pre&gt;graph theory Not astronomy sorry

I've been do some reading and Cellular Texture seams like what I need but the example I've seen are texture-centric


--
tom_a_sparks "It's a nerdy thing I like to do"
Please use ISO approved file formats excluding Office Open XML - http://www.gnu.org/philosophy/no-word-attachments.html
3 x (x)Ubuntu 10.04, Amiga A1200 WB 3.1, UAE AF 2006 WB 3.X, Sam440 AOS 4.1.2
Wanted: RiscOS system, GEOS system (C64/C128), Atari ST, Apple Macintosh (68k/PPC only) 

------------------------------------------------------------------------------
Malware Security Report: Protecting Your Business, Customers, and the 
Bottom Line. Protect your business and customers by understanding the 
threat from malware and how it can impact your online business. 
http://www.accelacomm.com/jaw/sfnl/114/51427462/
_______________________________________________
GDAlgorithms-list mailing list
GDAlgorithms-list&amp;lt; at &amp;gt;lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http:&lt;/pre&gt;</description>
    <dc:creator>Tom Sparks</dc:creator>
    <dc:date>2011-09-10T08:23:16</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22072">
    <title>Re: procedural star graph generator</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22072</link>
    <description>&lt;pre&gt;I think you need to define which interpretation of "star graph" you actually
mean.

Graph theory, or astronomy?

Sincerely,

jw


--
Americans might object: there is no way we would sacrifice our living
standards for the benefit of people in the rest of the world. Nevertheless,
whether we get there willingly or not, we shall soon have lower consumption
rates, because our present rates are unsustainable.



On Fri, Sep 9, 2011 at 1:10 AM, Tom Sparks &amp;lt;tom_a_sparks&amp;lt; at &amp;gt;yahoo.com.au&amp;gt;wrote:

------------------------------------------------------------------------------
Why Cloud-Based Security and Archiving Make Sense
Osterman Research conducted this study that outlines how and why cloud
computing security and archiving is rapidly being adopted across the IT 
space for its ease of implementation, lower cost, and increased 
reliability. Learn more. http://www.accelacomm.com/jaw/sfnl/114/51425301/_______________________________________________
GDAlgorithms-list mailing list
GDAlgorithms-list&amp;lt; at &amp;gt;lists.sourceforge.net
https&lt;/pre&gt;</description>
    <dc:creator>Jon Watte</dc:creator>
    <dc:date>2011-09-09T17:49:30</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22071">
    <title>Re: procedural star graph generator</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22071</link>
    <description>&lt;pre&gt;
When you say procedural there are two distinct ways of looking
at this word, either phenomenological or essentialist.

In other words, either start with a definition of
the results you want and work back to a generative basis, 
or start with some principles and develop a simplified
model. For the latter approach two knowledge sources 
to integrate could be

(1) Hughes, E.E Jr "The Luminosities and spatial distribution
of stars detected on a two micron sky survey" CalTec 1969

with

(2) Knuth V2 3.41/3.4.2 pp 119-142 Numerical Distributions

Draw a line through your sky to represent galactic equator.
Now use tables, functions and thresholing data from (1) with
methods from (2) to make your own plausible Milky Way*


* Eating sweets between meals _may_ ruin your appetite





On Fri, 9 Sep 2011 01:10:27 -0700 (PDT)
Tom Sparks &amp;lt;tom_a_sparks&amp;lt; at &amp;gt;yahoo.com.au&amp;gt; wrote:



&lt;/pre&gt;</description>
    <dc:creator>Andy Farnell</dc:creator>
    <dc:date>2011-09-09T16:32:59</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22070">
    <title>Re: procedural star graph generator</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22070</link>
    <description>&lt;pre&gt;I don't have a specific algorithm, but, I suspect if you were to apply the
Delaunay triangulation algorithm (
http://en.wikipedia.org/wiki/Delaunay_triangulation) to a slightly sparse
point set, and create a star at the center of mass of each resultant
triangle, you'd get something very close to what you want.

If I were to create an algorithm for such, I'd start there.  I'd implement
multiple layer point clouds, with different densities per, and for each
layer generate a different sort of star size depending on density / triangle
count of resultant surface.  For the stars themselves, it seems like you
could throw together a couple of simple algorithms based on 1/x / x2 / x3 /
etc to create variations of the traditional 4 point star shape, and then
color/scale them procedurally again depending on the relative density of the
layer into which they were being dropped.

The result should be a desirable and customizable spacing of stars with
appropriate distribution of near and distant stars, etc.

... but it dep&lt;/pre&gt;</description>
    <dc:creator>Megan Fox</dc:creator>
    <dc:date>2011-09-09T14:36:37</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22069">
    <title>procedural star graph generator</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22069</link>
    <description>&lt;pre&gt;

I am looking for some code that can procedurally generate a star graph

--
tom_a_sparks "It's a nerdy thing I like to do"
Please use ISO approved file formats excluding Office Open XML - http://www.gnu.org/philosophy/no-word-attachments.html
3 x (x)Ubuntu 10.04, Amiga A1200 WB 3.1, UAE AF 2006 WB 3.X, Sam440 AOS 4.1.2
Wanted: RiscOS system, GEOS system (C64/C128), Atari ST, Apple Macintosh (68k/PPC only)

------------------------------------------------------------------------------
Why Cloud-Based Security and Archiving Make Sense
Osterman Research conducted this study that outlines how and why cloud
computing security and archiving is rapidly being adopted across the IT 
space for its ease of implementation, lower cost, and increased 
reliability. Learn more. http://www.accelacomm.com/jaw/sfnl/114/51425301/
_______________________________________________
GDAlgorithms-list mailing list
GDAlgorithms-list&amp;lt; at &amp;gt;lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://s&lt;/pre&gt;</description>
    <dc:creator>Tom Sparks</dc:creator>
    <dc:date>2011-09-09T08:10:27</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22068">
    <title>Re: Good sources / RSS feeds to track emergingresearch papers?</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22068</link>
    <description>&lt;pre&gt;Hello,


I would like to add &amp;lt;http://academic.research.microsoft.com/&amp;gt;. It cross-links citations.


Jonathan


------------------------------------------------------------------------------
EMC VNX: the world's simplest storage, starting under $10K
The only unified storage solution that offers unified management 
Up to 160% more powerful than alternatives and 25% more efficient. 
Guaranteed. http://p.sf.net/sfu/emc-vnx-dev2dev
_______________________________________________
GDAlgorithms-list mailing list
GDAlgorithms-list&amp;lt; at &amp;gt;lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list

&lt;/pre&gt;</description>
    <dc:creator>Jonathan Sauer</dc:creator>
    <dc:date>2011-08-26T14:18:58</dc:date>
  </item>
  <item rdf:about="http://permalink.gmane.org/gmane.games.devel.algorithms/22067">
    <title>Re: mesh to 3D texture?</title>
    <link>http://permalink.gmane.org/gmane.games.devel.algorithms/22067</link>
    <description>&lt;pre&gt;Hi Jeff,

recently did some research myself, haven't yet come to the 
implementation side of things, so can't say much about real-world 
applicability:

These are IMHO the most promising results, when it comes to 
non-exlusively-binary voxelization:

Real-time GPU-based Voxelization and Applications (March 2011)
http://www.cs.wisc.edu/techreports/viewreport.php?report=1688

Two Simple Single-pass GPU methods for Multi-channel Surface 
Voxelization of Dynamic Scenes (Pacific Graphics 2011)
http://graphics.cs.aueb.gr/graphics/docs/papers/PG-2011optimized.pdf

They both give a nice wrap-up of previous work (especially Eisemann) and 
discuss the kind of problems you are worried about.
I will go for the second paper as basis for my implementation, not 
completely sure about performance though.

&amp;lt; at &amp;gt;all: if anyone has experience with those two papers, I'd be glad to know :)

Chris


------------------------------------------------------------------------------
EMC VNX: the world's simplest storage, starting under $10&lt;/pre&gt;</description>
    <dc:creator>Christian Heckl</dc:creator>
    <dc:date>2011-08-26T10:28:59</dc:date>
  </item>
  <textinput rdf:about="http://search.gmane.org/?group=$group=gmane.games.devel.algorithms">
    <title>Search Engine</title>
    <description>Search the mailing list at Gmane</description>
    <name>query</name>
    <link>http://search.gmane.org/?group=$group=gmane.games.devel.algorithms</link>
  </textinput>
</rdf:RDF>

