Linkability Rules

Template:Needs Translation/de Template:Needs Translation/es Template:Needs Translation/el Template:Needs Translation/he Template:Needs Translation/ko Template:Needs Translation/nl Template:Needs Translation/hu Template:Needs Translation/no Template:Needs Translation/da Template:Needs Translation/sv Template:Needs Translation/tr Template:Needs Translation/pl Template:Needs Translation/pt Template:Needs Translation/ru Template:Needs Translation/th Template:Needs Translation/uk Template:Needs Translation/zh-Hans Template:Needs Translation/zh-Hant

New Linkability Rule

The linkability rule for objects changed as of Dec 2010. The main motivation was to make the linkability check more efficient but a consequence is that they are also much simpler. The size-dependency of the prims has been discarded. The only thing that matters is the bounding sphere of the collection of prim centers. The linkability rule can be written as:

 LINKABLE = D < 54  AND  N ≤ 256
 where D = diameter of the smallest bounding sphere of the collection of prim centers
 and N = number of prims in the collection

Andrew Linden 21:47, 02 December 2010 (UTC)

If you are interested in how the old formula worked, see Linkability Rules/Havok 4.

Notes

• [2011-08-27-16:52] Andrew Linden: 54 was the minimum sphere that still contained all of the legacy linkable content.