Jump to content

OBD:AKBP: Difference between revisions

20 bytes removed ,  29 May 2008
linked to PLEA + trimmed wikipedia link
No edit summary
(linked to PLEA + trimmed wikipedia link)
Line 12: Line 12:
{{OBDtr | 0x1E | int16    |00FFFF| C4 06      | 1732      | array size }}
{{OBDtr | 0x1E | int16    |00FFFF| C4 06      | 1732      | array size }}
{{OBDtrBK}}
{{OBDtrBK}}
{{OBDtr | 0x00 | int32hb  |FFC8C8| 00 00 00 00 |0, high bit| plane index (in the environment plane array, see [[OBD:AKEV|AKEV]]), reverse plane normal if set }}
{{OBDtr | 0x00 | int32hb  |FFC8C8| 00 00 00 00 |0, high bit| plane index (in the environment [[PLEA|plane array]], see [[OBD:AKEV|AKEV]]), reverse plane normal if set }}
{{OBDtr | 0x04 | int32    |FFFFC8| 01 00 00 00 | 1        | front AKBP package number, -1 if none }}
{{OBDtr | 0x04 | int32    |FFFFC8| 01 00 00 00 | 1        | front AKBP package number, -1 if none }}
{{OBDtr | 0x08 | int32    |C8FFC8| FF FF FF FF | -1        | back AKBP package number, -1 if none }}
{{OBDtr | 0x08 | int32    |C8FFC8| FF FF FF FF | -1        | back AKBP package number, -1 if none }}
Line 19: Line 19:




AKBP contains one [[wikipedia:http://en.wikipedia.org/wiki/Binary_space_partitioning|BSP tree]] for each [[AKVA|BNV]] (the index of the root of the tree is stored in BNV). Such a tree is used to detect if a point is inside a BNV.
AKBP contains one [[wikipedia:Binary_space_partitioning|BSP tree]] for each [[AKVA|BNV]] (the index of the root of the tree is stored in BNV). Such a tree is used to detect if a point is inside a BNV.






{{OBD_File_Footer | type=AKBP | prev=AKBA | next=AKDA | name=BSP Node Array | family=Level}}
{{OBD_File_Footer | type=AKBP | prev=AKBA | next=AKDA | name=BSP Node Array | family=Level}}