.BSP is a map file extension used in games such as the Doom, Quake, and Half-Life series. .BSP files use binary space partitioning to generate levels that can be rendered quickly while minimizing the amount of polygons that need to be redrawn every time the screen refreshes. One of the biggest problems with the .BSP file format is that large open areas do not work well due to the nature of the partitioning algorithm used. A filename extension or filename suffix is an extra set of (usually) alphanumeric characters that is appended to the end of a filename to allow computer users (as well as various pieces of software on the computer system) to quickly determine the type of data stored in the file. ... Doom (or DOOM)[1] is a 1993 computer game by id Software that is among the landmark titles in the first-person shooter genre. ... Zombies attacking the player. ... Half-Life For a quantity subject to exponential decay, the half-life is the time required for the quantity to fall to half of its initial value. ... Binary space partitioning (BSP) is a method for recursively subdividing a space into convex sets by hyperplanes. ... A file format is a particular way to encode information for storage in a computer file. ...

Unlike the maps used in Unreal Tournament, .BSP files work by defining the edges of the map objects, as opposed to defining the hollow areas. .BSP files can be produced using such modelling tools as 3D Studio Max. A .BSP file includes everything in the map, except the textures (with the exception of Quake and Half-Life, BSP version 30), sounds, and a script (which lists the map name, and supported game types, such as Deathmatch or Infiltration). Unreal Tournament, UT, (sometimes referred to as UT99 or UT Classic or UT1 to differentiate from Unreal Tournament 2003, Unreal Tournament 2004 and Unreal Tournament 2007) is a popular first-person shooter video game. ... 3D Studio Max (name changed to 3DS Max, also sometimes called 3dsm, or just Max) is a 3D modeler developed by Autodesk Media & Entertainment (formerly known as Discreet and Kinetix). ... Zombies attacking the player. ... Half-Life For a quantity subject to exponential decay, the half-life is the time required for the quantity to fall to half of its initial value. ... Deathmatch (abbreviated DM) is a widely-used gameplay mode very well integrated into first-person shooter computer games. ... See: espionage, urban exploration, entryism, heating, ventilation, and air conditioning. ...

Lumps

Lumps are chunks of data, the offsets and lengths (in bytes) of which are defined in the file header, which may also contain the version of the BSP. The amount of lumps in a BSP differs from version to version, and the version used differs from game to game. For example, Quake II uses version 38 with 19 lumps, whereas James Bond 007: Nightfire uses version 42, with 18 lumps. For this reason, there are compatibility issues between games, and though conversion is possible, it is quite difficult. In computer science, an offset within an array or other data structure object is an integer indicating the distance (displacement) from the beginning of the object up until a given element or point, presumably within the same object. ... Quake II, released on December 6, 1997, is a first person shooter game developed by id Software and distributed by Activision. ... Nightfire is a first-person shooter video game based on the James Bond licence. ...

Although the amount of lumps, and therefore their functions, changes from version to version, most versions of the BSP contain lumps with similar functions, and sometimes even have identical formats. These include:

• Entities - defines where objects such as weapons, enemies, etc. are placed, as well as containing the scripting information for AIs to follow, telling sounds to play, or even doors to open or close. These are only a couple of many things that the entities lump handles.
• Planes - defines infinite planes, each one of which cuts the space it passes through into two spaces, hence binary space partitioning. The planes only divide the space within the node(s) that use them.
• Nodes - this lump simply makes use of the planes, and indexes the spaces created by them. If the index is positive, that space is partitioned further by one or more plane(s). If it's negative, it's indexed as a leaf.
• Leaves - These are the convex polygons that are the end result of the partitioning using planes. This lump defines what these polygons are made of (solid, liquid, empty, etc.), usually through use of another lump such as brushes. One major disadvantage of using this type of data structure, known as the BSP Tree, is that concave polygons CAN NOT be used.
• Visibility - Since there can be a large number of leaves in a map, it could be quite costly for the hardware to redraw the entirety of them many times a second. Thus the visibility lump defines what is visible to a player when they're in a specific leaf. Since there can be a great many leaves in any one map, it is stored as a binary array, each bit defining whether any specific leaf is visible or not (1 or 0, respectively). This method saves a great amount of space in temporary memory, as well as storage space of the map itself.
• Textures - this lump is a list of textures, which is indexed for ease of applying them to each individual leaf face.
• Faces - since leaves are many-sided polygons, any one of the sides, or faces, of that polygon can have a texture applied to it. This along with lighting effects, and other things that affect the look of the face is handled by this lump.
• Vertices and Meshes - These two lumps (or in some cases, one Meshverts lump) are used by faces to split textures into triangles for better application onto a face. These triangles don't necessarily have to be congruent, and this method is actually understandable. Triangles can by used to form any two-dimensional polygon.

Other lumps are used by different versions to manipulate these lumps in many ways, and can be used to get nearly, if not exactly, the same effect in any version of the BSP. Binary space partitioning (BSP) is a method for recursively subdividing a space into convex sets by hyperplanes. ...

See also

• Binary space partitioning