Binary space partitioning
id:
binary-space-partitioning-224-3074
title:
Binary space partitioning
text:
In computer science, binary space partitioning (BSP) is a method for space partitioning which recursively subdivides a Euclidean space into two convex sets by using hyperplanes as partitions. This process of subdividing gives rise to a representation of objects within the space in the form of a tree data structure known as a BSP tree. Binary space partitioning was developed in the context of 3D computer graphics in 1969. The structure of a BSP tree is useful in rendering because it can efficient
brand slug:
wiki
category slug:
encyclopedia
description:
Method for recursively subdividing a space into two subsets using hyperplanes
original url:
https://en.wikipedia.org/wiki/Binary_space_partitioning
date created:
2002-08-20T07:08:47Z
date modified:
2024-09-14T11:43:50Z
main entity:
{"identifier":"Q863513","url":"https://www.wikidata.org/entity/Q863513"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/8/81/Binary_space_partition.png","width":664,"height":281}
fields total:
13
integrity:
16