1 Mar 2013 10:56

### Spherical Harmonic Filtering

```Hi all,

I was revisiting some of our old shader code (order 2, i.e. 9-coefficients) trying to fix ringing in some
high contrast environments. I am looking at Stupid Spherical Harmonics (SH) Tricks by Peter-Pike Sloan,

The Lanczos and Han functions mentioned are of form:

sin(pi*x/w)/(x/w)

and

(1+cos(pi*x/w))/2

respectively, for a given filtering window of width "w". The rest of text, as far as I can see, seems to imply
that w should be equal to the order of SH used. (w=6 for 6th order).

Initially, I would expecting filtering to be done by convolution in spatial domain, by projecting the
filter function to the SH basis and then multiplying its y[l,0] coefficients into appropriate bands
(y[l,m]) of the filtered function. However, all the other notions in there seem to point to this actually
being done as multiplication in frequency domain. More specifically, as if the filtering function as
presented here above _already is_ the frequency domain presentation. So it would just multiply of y(l,m)
coefficients of the filtered function by values of the filter evaluated at integers.

This looks rather unusual to me, but I guess there is some reasoning behind all that.

As a side note, I got some ok-ish results with filtering in spatial domain (aka. bluring) using Han function
as above (*) with value w=1.5 through convolution as described above. (Where the number w=1.5 was "tuned"
by manual binary search with visual assessment of results to minimize visible ringing without
introducing "too much" blur.) While on the other hand, using the multiplication directly in frequency
```

13 Dec 2012 19:22

### Finding the best pose to re-enter animation graph from ragdoll

```Hi all,

I've got a ragdolled character that I want to begin animating again.
I've got a number of states in my animation graph marked as 'recovery
points', i.e. animations that a ragdoll can reasonably be blended back
to before having the animation graph take over fully. The problem is,
I'm not sure how to identify which animation's first frame (the
'recovery pose') is closest to the ragdoll's current pose.

As I see it there are two components to computing a score for each
potential recovery point:

1) For each non-root bone, sum the differences in parent-space rotation
between current and recovery poses. This is simple enough to do; in
addition I think I need to weight the values (e.g. by the physics mass
of the bone), as a pose that is off by 30 degrees in the upper arm
stands to look a lot less similar to the ragdoll's pose than one that is
only off by 30 degrees in the wrist. The result of this step is some
kind of score representing the object-space similarity of the poses.

2) Add to (1) some value representing how similar the root bones are.
The problem I've got here is that I need to ignore rotation around the
global Y axis, while still accounting for other rotations. (I can ignore
position as well, as I can move the character's reference frame to
account for it).

Suppose I have a recovery pose animation that has been authored such
that the character is lying stretched out prone, on his stomach, facing
along +Z. If the ragdoll is also lying stretched out prone on his
stomach, facing -X, then the recovery pose is still fine to use - I just
```

12 Sep 2012 02:45

### CFP - INTERNATIONAL JOURNAL OF EXPERIMENTAL ALGORITHMS(IJEA)

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

Volume 3, Issue 1

Computer Science Journals (CSC Journals) invites researchers, editors, scientists & 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 practitioners. IJEA is a high-quality, refereed, archival journal devoted to the study of algorithms and data structures through a combination of experimentation and classical analysis and design techniques. IJEA contributions are also in the area of test generation and result assessment as applied to algorithms.

CSC Journals anticipate and invite papers on any of the following topics:

 Algorithm Engineering Dynamic Graph Algorithms Algorithmic Code Experimental Techniques and Statistics Algorithmic Engineering Graph Manipulation Algorithmic Network Analysis Graphics Analysis of Algorithms Heuristics Approximation Techniques Mathematical Programming For Algorithms Cache Oblivious algorithm Metaheuristic Methodologies Combinatorial Optimization Network Design Combinatorial Structures and Graphs Parallel Processing Computational Biology Randomized Techniques in Algorithms Computational Geometry Routing and Scheduling Computational Learning Theory Searching and Sorting Computational Optimization Topological Accuracy Data Structures Visualization Code Distributed and Parallel Algorithms VLSI Design

Important Dates - IJEA CFP - Volume 3, Issue 1.

Paper Submission: September 30, 2012

Issue Publication: December 2012

For complete details about IJEA archives publications, abstracting/indexing, editorial board and other important information, please refer to IJEA homepage.

We look forward to receive your valuable papers. If you have further questions please do not hesitate to contact us at cscpress <at> cscjournals.org. Our team is committed to provide a quick and supportive service throughout the publication process.

A complete list of journals can be found at http://www.cscjournals.org/csc/bysubject.php

Sincerely,

J. Stewart
Computer Science Journals (CSC Journals)

B-5-8 Plaza Mont Kiara, Mont Kiara
50480, Kuala Lumpur, Malaysia

Tel: + 603 6207 1607, + 603 2782 6991
Fax:+ 603 6207 1697
Url: http://www.cscjournals.org

```------------------------------------------------------------------------------
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 <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list```
27 Jun 2012 23:52

### (no subject)

```------------------------------------------------------------------------------
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 <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list```
27 Jun 2012 23:47

### (no subject)

```------------------------------------------------------------------------------
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 <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list```
28 Apr 2012 12:36

### Procedural scenes

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 <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list```
29 Feb 2012 21:38

### CFP - INTERNATIONAL JOURNAL OF ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS (IJAE)

CALL FOR PAPERS - INTERNATIONAL JOURNAL OF ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS (IJAE)

ISSN: 2180-124X

Volume 3, Issue 3

Computer Science Journals (CSC Journals) invites researchers, editors, scientists & 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 & 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 practitioners in the design and development of intelligent and expert systems, and the difficulties faced by the practitioners in using the theoretical results provide feedback to the theoreticians to revalidate their models. IJAE thus meets the demand of both theoretical and applied researchers in artificial intelligence, soft computing and expert systems.

IJAE is a broad journal covering all branches of Artificial Intelligence and Expert Systems and its application in the topics including but not limited to technology & computing, fuzzy logic, expert systems, neural networks, reasoning and evolution, automatic control, mechatronics, robotics, web intelligence applications, heuristic and AI planning strategies and tools, computational theories of learning, intelligent system architectures.

CSC Journals anticipate and invite papers on any of the following topics:

 AI for Service Engineering Integrated/Hybrid AI Approaches AI for Web Intelligence Applications Intelligent Planning AI in Bioinformatics Intelligent Search AI Parallel Processing Tools Intelligent System Architectures AI Tools for CAD and VLSI Analysis/Design/Testing Knowledge Acquisition AI Tools for Computer Vision and Speech Understand Knowledge-Based Systems AI Tools for Multimedia Knowledge-Based/Expert Systems Application in VLSI Algorithms and Mobile Communication Logic Programming Automated Reasoning Machine learning Case-based reasoning Multi-agent Systems Data and Web Mining Neural Computing Derivative-free Optimization Algorithms Neural Networks for AI Emotional Intelligence Object-Oriented Programming for AI Evolutionary and Swarm Algorithms Parallel and Distributed Realization of Intelligence Expert System Development Stages Problem solving Methods Expert Systems Components Reasoning and Evolution of Knowledge Bases Expert-System Development Lifecycle Rough Sets Fuzzy Sets and logic Rule-Based Systems Heuristic and AI Planning Strategies and Tools Self-Healing and Autonomous Systems Hybridization of Intelligent Models/algorithms Uncertainty Image Understanding Visual/linguistic Perception Inference

Important Dates - IJAE CFP - Volume 3, Issue 3.

Paper Submission: March 31, 2012

Issue Publication: June 2012

For complete details about IJAE archives publications, abstracting/indexing, editorial board and other important information, please refer to IJAE homepage.

We look forward to receive your valuable papers. If you have further questions please do not hesitate to contact us at cscpress <at> cscjournals.org. Our team is committed to provide a quick and supportive service throughout the publication process.

A complete list of journals can be found at http://www.cscjournals.org/csc/bysubject.php

Sincerely,

J. Stewart
Computer Science Journals (CSC Journals)

B-5-8 Plaza Mont Kiara, Mont Kiara
50480, Kuala Lumpur, Malaysia

Tel: + 603 6207 1607, + 603 2782 6991
Fax:+ 603 6207 1697
Url: http://www.cscjournals.org
```------------------------------------------------------------------------------
Virtualization & Cloud Management Using Capacity Planning
Cloud computing makes use of virtualization - but cloud computing
also focuses on allowing computing to be delivered as a service.
http://www.accelacomm.com/jaw/sfnl/114/51521223/```
```_______________________________________________
GDAlgorithms-list mailing list
GDAlgorithms-list <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list```
21 Feb 2012 19:52

### CFP - INTERNATIONAL JOURNAL OF EXPERIMENTAL ALGORITHMS(IJEA)

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

Volume 3, Issue 1

Computer Science Journals (CSC Journals) invites researchers, editors, scientists & 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 practitioners. IJEA is a high-quality, refereed, archival journal devoted to the study of algorithms and data structures through a combination of experimentation and classical analysis and design techniques. IJEA contributions are also in the area of test generation and result assessment as applied to algorithms.

CSC Journals anticipate and invite papers on any of the following topics:

 Algorithm Engineering Dynamic Graph Algorithms Algorithmic Code Experimental Techniques and Statistics Algorithmic Engineering Graph Manipulation Algorithmic Network Analysis Graphics Analysis of Algorithms Heuristics Approximation Techniques Mathematical Programming For Algorithms Cache Oblivious algorithm Metaheuristic Methodologies Combinatorial Optimization Network Design Combinatorial Structures and Graphs Parallel Processing Computational Biology Randomized Techniques in Algorithms Computational Geometry Routing and Scheduling Computational Learning Theory Searching and Sorting Computational Optimization Topological Accuracy Data Structures Visualization Code Distributed and Parallel Algorithms VLSI Design

Important Dates - IJEA CFP - Volume 3, Issue 1.

Paper Submission: March 31, 2012

Issue Publication: June 2012

For complete details about IJEA archives publications, abstracting/indexing, editorial board and other important information, please refer to IJEA homepage.

We look forward to receive your valuable papers. If you have further questions please do not hesitate to contact us at cscpress <at> cscjournals.org. Our team is committed to provide a quick and supportive service throughout the publication process.

A complete list of journals can be found at http://www.cscjournals.org/csc/bysubject.php

Sincerely,

J. Stewart
Computer Science Journals (CSC Journals)

B-5-8 Plaza Mont Kiara, Mont Kiara
50480, Kuala Lumpur, Malaysia

Tel: + 603 6207 1607, + 603 2782 6991
Fax:+ 603 6207 1697
Url: http://www.cscjournals.org

```------------------------------------------------------------------------------
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```
```_______________________________________________
GDAlgorithms-list mailing list
GDAlgorithms-list <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list```
3 Feb 2012 00:22

### 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

```------------------------------------------------------------------------------
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```
```_______________________________________________
GDAlgorithms-list mailing list
GDAlgorithms-list <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list```
27 Oct 2011 18:07

### Invitation to connect on LinkedIn

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

Game,

- Alias

le>
You are receiving Invitation to Connect emails. Unsubscribe
© 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 <at> Cisco Self-Assessment and learn
about Cisco certifications, training, and career opportunities.
http://p.sf.net/sfu/cisco-dev2dev```
```_______________________________________________
GDAlgorithms-list mailing list
GDAlgorithms-list <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list```
23 Oct 2011 02:20

### marcsh wants questions from you on Formspring

h1,p,table { font-family:'Helvetica Neue', Arial, sans-serif; color:#4d4d4d; font-size:14px;} p, table tr td p {font-family:'Helvetica Neue', Arial, sans-serif; font-size:14px; color:#4d4d4d; margin-bottom:18px;} table tr td p a {font-weight:bold;} p { margin-bottom:18px; } a { color:#548cb3; }

# 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
```------------------------------------------------------------------------------
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 <at> Cisco Self-Assessment and learn
about Cisco certifications, training, and career opportunities.
http://p.sf.net/sfu/cisco-dev2dev```
```_______________________________________________
GDAlgorithms-list mailing list
GDAlgorithms-list <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list```

Gmane