OBD:OTLF

ONI BINARY DATA OTIT << Other file types >> PLEA OTLF : Oct Tree Leaf Node Array switch to XML:OTLF page Overview @ Oni Stuff

Offset	Type	Raw Hex	Value	Description
0x00	res_id	01 45 02 00	581	00581-.OTLF
0x04	lev_id	01 00 00 06	3	level 3
0x08	char[20]	AD DE	dead	unused
0x1C	int32	03 49 00 00	18691	array size
First element (black outline)
0x00	int12-20	00 00 00 00	0, 0	bits 0-11 (12 bits) contain the number of gunk quads that intersect this leaf, bits 12-31 (20 bits) contain the index of the gunk quad list; see details below
0x04	int32hb	FF FF FF FF	-1	negative x neighbour
0x08	int32hb	01 00 00 80	1, high bit	positive x neighbour
0x0C	int32hb	FF FF FF FF	-1	negative y neighbour
0x10	int32hb	02 00 00 80	2, high bit	positive y neighbour
0x14	int32hb	FF FF FF FF	-1	negative z neighbour
0x18	int32hb	04 00 00 80	4, high bit	positive z neighbour
0x1C	int9-9-9-5	7F FE FC 39	127, 127, 127, 7	bits 0-8 (9 bits) contain the index of max x, bits 9-17 (9 bits) contain the index of max y, bits 18-26 (9 bits) contain the index of max z and bits 27-31 (5 bits) contain the index of the size of this leaf; see details below
0x20	int8-24	00 00 00 00	0, 0	bits 0-7 (8 bits) intersected BNV count, bits 8-31 (24 bits) BNV list index; see details below

Intersected gunk quads

An octtree leaf (OTLF) stores its size and position and the gunk quads that intersect it. The first field contains an index/count pair that is used to access the first IDXA field that is stored in the AKOT that owns this leaf. This IDXA contains the gunk quad numbers that intersect the leaf. In theory there can be at most 4095 gunk quads that intersect a leaf but in practice this number is much lower (max is 462). In addition the threshold limit used to build the octree seems to be 19 gunk quads per leaf. I.e., in Oni's levels, only the smallest leaves (with size 16x16x16) have more than 19 quads; larger leaves containing 20 and more quads are subdivided into "other, smaller boxes".

Intersected BNVs

An octtree leaf can intersect some BNVs (see AKVA). The last field contains the index and count of this list in the second IDXA field of AKOT.

Position and size

The position (of leaf's positive corner) is stored as three 9 bit fields. These values are not the x, y and z coordinates themselves but they are indices into a constant table. This constant table has 512 entries starting with -4080.0 and going up to 4096.0 in 16 units increments.

The size of leaf is stored in a 5 bit field and it is and index into another constant table. This table has 9 entries starting with 16.0 and going up to 4096.0 (each entry is double the previous one).

• Maximum environment size is (8192.0, 8192.0, 8192.0)
• Minimum coordinate is (-4096.0, -4096.0, -4096.0)
• Maximum coordinate is (4096.0, 4096.0, 4096.0)
• Minimum leaf size is 16.0
• Maximum leaf size is 4096.0 (this means that there will always be at least 8 leaves because the size of the environment is double).

Neighbours

A leaf can have 6 neighbours (one for each face). If a face does not have a neighbour (it's on an environment border) then the coresponding field is -1. If a neighbour field value has its high bit set then the value (without the high bit) is the index of another octtree leaf (this is the case when when the neighbour leaf is equal to or larger than the leaf). If the high bit is not set then the value is an index into a quadtree node array (the QTNA field of AKOT) (this is the case when there is more than one leaf neighbour for a face).

Example

The above leaf does not intersect any quads, has its maximum corner at (-2048.0, -2048.0, -2048.0), a size of 2048.0, no neighbours for all negative faces (it's right in the negative corner of the environment) and positive faces have leaves as neighbours (no quadtree nodes here).

Theoretical limits

If the environment (size 8192x8192x8192) is subdivided into minimal cubes (size 16x16x16) in all three directions, the total number of leaves is 512x512x512 = 134,217,728, and with a maximum of 4095 quads per leaf one could expect a theoretical maximum of 549,621,596,160 distinct quads per level. (Half a trillion quads, or a trillion triangles. That's crazy much.)

However, the maximum size of the AKOT's first IDXA that can be referenced through a leaf's 0x00 field is actually 1,052,670 (a combination of the 20-bit index to the start of a leaf's quad list and the 12-bit length of that list). Thus the maximum number of distinct quads in a level (properly referenced by oct-tree leaves) can not exceed 1,052,670, which is much more comfortable sanity-wise (two million triangles is fairly common for game environments nowadays).

In practice, though, the engine imposes even more modest limitations:

• only up to 8192 environment triangles are expected to be visible (rendered) at any given time (they can be packed as 4096 quads, or as 8192 actual triangles, or any combination of tris and quads).

  If you attempt to view more than 8192 triangles at once, Oni will not crash, but:

  • it will complain with the dev-console message "Exceeded max visible GQs #", where # is the number of triangles in excess of 8192;
  • it will start dropping random triangles from the rendering pipeline;
  • collision will start to fail on the "dropped" triangles.

  The amount of other visible geometry (characters, particles etc) does not affect this limit.

• only up to 262140 triangles (e.g., as 131070 quads) are allowed in a level's environment. Attempting to load a level with 262141 environment triangles (as any combination of triangles and quads) will cause Oni to Blam.

  (N.B. This has been identified as a bug that will be fixed in future versions, so that the theoretical maximum of 1,052,670 quads (2,105,340‬ triangles) can be reached: if you cut a level into "sections" ("rooms" or "scenes") where you can view no more than 8192 triangles at once, then basically you are allowed to have 256 such "sections" in a level. If you add an extra set of environment polygons for cel-shading and/or lightmapping, then the limit will be cut in 2 or 3.)

ONI BINARY DATA
OTIT << Other file types >> PLEA
OTLF : Oct Tree Leaf Node Array
Level file