binary partition - перевод на русский
Diclib.com
Словарь онлайн

binary partition - перевод на русский

METHOD FOR RECURSIVELY SUBDIVIDING A SPACE INTO TWO SUBSETS USING HYPERPLANES
Binary Space Partition; BSP tree; Binary space partition tree; Binary space partition; Bsp tree; Binary Space Partitioning; BSP trees; BSP-tree
  • The process of making a BSP tree
  • center

binary partition      

математика

двоичное разбиение

conjugate partition         
  • x
  • *
  • k}}
  • *
DECOMPOSITION OF AN INTEGER AS A SUM OF POSITIVE INTEGERS
Partition of an integer; Partition of a number; Ferrers graph; Ferrers diagram; Integer partition function; Partition of numbers; Rademacher's series; Ferrars diagram; Number partitioning problem; Integer partition; Integer partitions; Rademacher series; Ferrers Diagrams; Partition theory; Restricted partition; Conjugate partition; Conjugate partitions; Euler's partition theorem

математика

сопряжённое разбиение

restricted partition         
  • x
  • *
  • k}}
  • *
DECOMPOSITION OF AN INTEGER AS A SUM OF POSITIVE INTEGERS
Partition of an integer; Partition of a number; Ferrers graph; Ferrers diagram; Integer partition function; Partition of numbers; Rademacher's series; Ferrars diagram; Number partitioning problem; Integer partition; Integer partitions; Rademacher series; Ferrers Diagrams; Partition theory; Restricted partition; Conjugate partition; Conjugate partitions; Euler's partition theorem

математика

разбиение на ограниченные части

Определение

eclipsing binary
¦ noun Astronomy a binary star whose brightness varies periodically as the two components pass one in front of the other.

Википедия

Binary space partitioning

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 efficiently give spatial information about the objects in a scene, such as objects being ordered from front-to-back with respect to a viewer at a given location. Other applications of BSP include: performing geometrical operations with shapes (constructive solid geometry) in CAD, collision detection in robotics and 3D video games, ray tracing, and other applications that involve the handling of complex spatial scenes.