Java-Gaming.org Java4K winners: [ by our judges | by the community ]         
Featured games (67)
games approved by the League of Dukes 		Games in Showcase (∞)
games submitted by our members



News: Read the Java Gaming Resources, or peek at the official Java tutorials
 
    Home     Help   Search   Login   Register   
Java-Gaming.org > Game Development > Game Mechanics > Game Mechanics - Resources
Pages: [1]
  Print  
  Game Mechanics - Resources  (Read 15539 times)
0 Members and 1 Guest are viewing this topic.
Offline Amos Wenger

JGO Kernel
*****

Posts: 1750


Everything's possible, but not everything's fun...
« on: 2005-12-21 05:55:38 »
This topic is yours ! Post your physic resources here so we can have a complete knowledge base
"Once you start working on something, don't be afraid of failure and don't abandon it. People who work sincerely are the happiest"
Offline t_larkworthy

Sr. Member
**

Posts: 467
Medals: 2


Java games rock!
« Reply #1 on: 2005-12-23 09:55:16 »
Physics

Baraff's LCP algoritm, as used in ODE (and JOODE)
http://www.cs.cmu.edu/~baraff/papers/sig94.pdf
and why it doesn't always work:
http://crl.nmsu.edu/users/sb/papers/thesis/node20.html
Good introductory material
http://www.d6.com/users/checker/dynamics.htm

Collision detection

BSP trees. Can be used to classify space quickly
http://www.faqs.org/faqs/graphics/bsptree-faq/

The OBB tree, provides a fast boolean result for trimesh collisions
http://citeseer.ist.psu.edu/gottschalk96obbtree.html

DEEP, Dual-space Expansion for Estimating Penetration Depth. http://www.cs.unc.edu/~geom/DEEP/icra02.pdf
See http://www.java-gaming.org/forums/index.php?topic=10976.195 for hints on deciphering this paper

Example of the sweep line algorithm, the fore father of initial planar subdivision algorithms (but a bit outdated now)
http://www.lupinho.de/gishur/html/Sweeps.html

Math:-

JAMA is comprised of six Java classes: Matrix, CholeskyDecomposition, LUDecomposition, QRDecomposition, SingularValueDecomposition and EigenvalueDecomposition.
http://math.nist.gov/javanumerics/jama/

Wikopedia's writup of Cholesky is fairly easy to read. Cholesky decompositions are used to solve linear equations. They use alot of square roots though.
http://en.wikipedia.org/wiki/Cholesky_decomposition

The Orbital library is a class library providing object-oriented representations and algorithms for logic, mathematics and artificial intelligence. It comprises theorem proving, computer algebra, search and planning, as well as machine learning algorithms.
http://www.functologic.com/orbital/

ECJ is a research Evolutionary Computing system written in Java. (Good for optimizations)
http://cs.gmu.edu/~eclab/projects/ecj/
Offline kylix999

Full Member
**

Posts: 193
« Reply #2 on: 2006-01-14 03:07:09 »

i found these intresting video lectures if somebody intrested in the most basic topics of algebra etc:

http://ocw.mit.edu/OcwWeb/Mathematics/18-06Spring-2005/VideoLectures/index.htm


Do you have other resource links for:

1) programming constraints - especialy how to code it and solve as lcp
2) resting contacts - the same how to code it
Games published by our own members! Go get 'em!
Offline Amos Wenger

JGO Kernel
*****

Posts: 1750


Everything's possible, but not everything's fun...
« Reply #3 on: 2006-02-24 11:23:21 »
Quote from: kylix999 on 2006-01-14 03:07:09
Do you have other resource links for:

1) programming constraints - especialy how to code it and solve as lcp
2) resting contacts - the same how to code it
Baraff papers (http://www.cs.cmu.edu/~baraff/papers/sig94.pdf) explain that. However I find them a bit hard (I'm actually looking for simpler documents that can drive me to understand Baraff's work).
"Once you start working on something, don't be afraid of failure and don't abandon it. People who work sincerely are the happiest"
Offline kylix999

Full Member
**

Posts: 193
« Reply #4 on: 2006-02-25 01:22:30 »

there are lots of academics papers which for programmers without excellent knowledge of mathematics and advanced physics are hard to understand.  I saw Baraff work but it is not for me, j have not graduated physics studies... so i am looking for simpler papers just like you MagicSpark.org [ BlueSky ], so please post something if you find, thanx
Offline Raghar

Sr. Member
**

Posts: 331


Ue ni taete 'ru hitomi ni kono mi wa dou utsuru
« Reply #5 on: 2006-03-01 18:57:25 »
http://softsurfer.com
is another nice site
Offline horizon_w

JGO n00b
*

Posts: 2
« Reply #6 on: 2006-05-15 23:16:46 »
 thanks for sharing the resource about physical and  math. But most of them seemed a little theoretical, if  we can share the imformation about physical and math coding ,it will be nice.
Offline Amos Wenger

JGO Kernel
*****

Posts: 1750


Everything's possible, but not everything's fun...
« Reply #7 on: 2006-05-16 11:00:28 »
The Game Programming Wiki contains some math and physics tutorials :

http://gpwiki.org/index.php/Tutorials_and_Source_Code#Physics_.2F_Math_.2F_Transformations
"Once you start working on something, don't be afraid of failure and don't abandon it. People who work sincerely are the happiest"
Offline kitfox

Full Member
**

Posts: 135


Java games rock!
« Reply #8 on: 2006-09-27 19:53:35 »
Here are some more resources from a forum on the Bullet engine:

http://continuousphysics.com/Bullet/phpBB2/viewtopic.php?p=1935#1935

In summary, a good collision detection paper:
http://www.continuousphysics.com/ftp/pub/test/index.php?dir=physics/papers/&file=gino_van_den_bergen_phd.pdf

and some theses on implementing a physics engine:
http://www.diku.dk/forskning/image/publications/erleben.html
Offline kuroyan

JGO n00b
*

Posts: 9
« Reply #9 on: 2007-02-27 17:32:11 »
Java applets focusing on physical forces + explanations:
www.myphysicslab.com
Games published by our own members! Go get 'em!
Offline Curro

JGO n00b
*

Posts: 7


Java games rock!
« Reply #10 on: 2007-08-01 08:07:34 »
A list contains  main Physic  Engines available Internet.
http://www.digitalrune.com/KnowledgeBase/RigidBodyDynamics/PhysicsEnginesList/tabid/476/lang/en-US/default.aspx
Offline pjt33

JGO Strike Force
***

Posts: 913
Medals: 17
« Reply #11 on: 2009-02-06 05:00:42 »
Quote from: t_larkworthy on 2005-12-23 09:55:16
Physics

Baraff's LCP algoritm, as used in ODE (and JOODE)
http://www.cs.cmu.edu/~baraff/papers/sig94.pdf
and why it doesn't always work:
http://crl.nmsu.edu/users/sb/papers/thesis/node20.html
I may be missing something, but isn't that second link about LP rather than LCP? LCP doesn't always work, it's true, but for different reasons.
Offline t_larkworthy

Sr. Member
**

Posts: 467
Medals: 2


Java games rock!
« Reply #12 on: 2009-02-06 09:07:12 »
Barraff's LCP is derived from Dantzig's algorithm. Barraff's LCP is virtually a linear program, and certainly is a simplex method. So those arguments are valid. However, I would treat most of the material I posted years ago with some caution as I hardly knew what I was talking about then Smiley
Offline pjt33

JGO Strike Force
***

Posts: 913
Medals: 17
« Reply #13 on: 2009-02-06 12:11:46 »
Quote from: t_larkworthy on 2009-02-06 09:07:12
Barraff's LCP is derived from Dantzig's algorithm. Barraff's LCP is virtually a linear program, and certainly is a simplex method. So those arguments are valid. However, I would treat most of the material I posted years ago with some caution as I hardly knew what I was talking about then Smiley

It's certainly closely related to LP, but doesn't the different setup mean that looping is impossible? And whereas the first problem listed for LPs is finding an initial feasible solution, LCP terminates as soon as you find a feasible solution.
Offline t_larkworthy

Sr. Member
**

Posts: 467
Medals: 2


Java games rock!
« Reply #14 on: 2009-02-07 09:16:36 »
Quote
but doesn't the different setup mean that looping is impossible?
Infinite looping is still possible with LCP. ODE permutes its parameters when it detects its having problems, and if it can't solve the equations it returns an invalid solution.

Quote
LCP terminates as soon as you find a feasible solution.
Yeah, LCP is not maximizing a cost function.

Quote
And whereas the first problem listed for LPs is finding an initial feasible solution
well that is the key problem for LCP. As it is just returning a feasible solution, the LCP fails when it can't find a feasible solution. Which can happen in real systems, but more often than not it also happens because of numerical issues.





 
Pages: [1]
  Print  
 
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.16 | SMF © 2011, Simple Machines Valid XHTML 1.0! Valid CSS!
Page created in 0.158 seconds with 20 queries.