Concepts inBinary plane partitions for disjoint line segments
Line segment
In geometry, a line segment is a part of a line that is bounded by two end points, and contains every point on the line between its end points. Examples of line segments include the sides of a triangle or square. More generally, when the end points are both vertices of a polygon, the line segment is either an edge (of that polygon) if they are adjacent vertices, or otherwise a diagonal. When the end points both lie on a curve such as a circle, a line segment is called a chord (of that curve).
more from Wikipedia
Disjoint sets
In mathematics, two sets are said to be disjoint if they have no element in common. For example, {1, 2, 3} and {4, 5, 6} are disjoint sets.
more from Wikipedia
Plane partition
In mathematics, a plane partition (see also solid partition for three-dimensional array) is a two-dimensional array of nonnegative integers which are nonincreasing from left to right and top to bottom: Thinking of the stack of unit cubes placed on (i,j)-square, we obtain a solid (or 3-dimensional) partition. Define the sum of the plane partition by and let PL(n) denote the number of plane partitions with sum n. For example, there are six plane partitions with sum 3: so PL(3) = 6.
more from Wikipedia
Binary file
A binary file is a computer file which may contain any type of data, encoded in binary form for computer storage and processing purposes; for example, computer document files containing formatted text. Many binary file formats contain parts that can be interpreted as text; binary files that contain only textual data¿without, for example, any formatting information¿are called plain text files.
more from Wikipedia
Binary space partitioning
In computer science, binary space partitioning (BSP) is a method for recursively subdividing a space into convex sets by hyperplanes. This subdivision gives rise to a representation of the scene by means of a tree data structure known as a BSP tree. Originally, this approach was proposed in 3D computer graphics to increase the rendering efficiency by precomputing the BSP tree prior to low-level rendering operations.
more from Wikipedia
Hyperplane
A hyperplane is a concept in geometry. It is a generalization of the plane into a different number of dimensions. A hyperplane of an n-dimensional space is a flat subset with dimension n ¿ 1. By its nature, it separates the space into two half spaces.
more from Wikipedia
Partition of a set
In mathematics, a partition of a set X is a division of X into non-overlapping and non-empty "parts" or "blocks" or "cells" that cover all of X. More formally, these "cells" are both collectively exhaustive and mutually exclusive with respect to the set being partitioned.
more from Wikipedia
Open set
In topology, a set is called an open set if it is a neighborhood of every point . When dealing with metric spaces, this can be intuitively interpreted as saying that every can be "moved" some non-zero distance, in any direction, and it will still lie within . The notion of an open set provides a fundamental way to speak of nearness of points in a topological space, without explicitly having a concept of distance defined.
more from Wikipedia