Binary Space Partitioning

In computer science, binary space partitioning (BSP) is a method for space partitioning which recursively subdivides an 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.

How you will benefit

(I) Insights, and validations about the following topics:

Chapter 1: Binary space partitioning

Chapter 2: Binary tree

Chapter 3: Rendering (computer graphics)

Chapter 4: Scanline rendering

Chapter 5: Hidden-surface determination

Chapter 6: Quadtree

Chapter 7: Octree

Chapter 8: Space partitioning

Chapter 9: K-d tree

Chapter 10: Clipping (computer graphics)

(II) Answering the public top questions about binary space partitioning.

(III) Real world examples for the usage of binary space partitioning in many fields.

Who this book is for

Professionals, undergraduate and graduate students, enthusiasts, hobbyists, and those who want to go beyond basic knowledge or information for any kind of Binary Space Partitioning.