two-dimensional tree
Смотреть что такое "two-dimensional tree" в других словарях:
two-dimensional figure — noun a two dimensional shape • Syn: ↑plane figure • Hypernyms: ↑figure • Hyponyms: ↑heart, ↑polygon, ↑polygonal shape, ↑conic section, ↑ … Useful english dictionary
Dimensional Fact Model — Data Warehouses (DWs) are databases used by decision makers to analyze the status and the development of an organization. DWs are based on large amounts of data integrated from heterogeneous sources into multidimensional databases, and they are… … Wikipedia
tree diagram — noun a figure that branches from a single root genealogical tree • Syn: ↑tree • Hypernyms: ↑plane figure, ↑two dimensional figure • Hyponyms: ↑cladogram, ↑ste … Useful english dictionary
Tree of Jesse — The oldest complete Jesse Tree window is in Chartres Cathedral, 1145. The Tree of Jesse is a depiction in art of the Ancestors of Christ, shown in a tree which rises from Jesse of Bethlehem, the father of King David; the original use of the… … Wikipedia
Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Hilbert R-tree — Hilbert R tree, an R tree variant, is an index for multidimensional objects like lines, regions, 3 D objects, or high dimensional feature based parametric objects. It can be thought of as an extension to B+ tree for multidimensional objects.The… … Wikipedia
Interval tree — In computer science, an interval tree, also called a segment tree or segtree, is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is… … Wikipedia
H tree — Not to be confused with Htree, a Linux filesystem indexing structure. The first ten levels of an H tree The H tree (so called because its first two steps resemble the letter H ) is a family of fractal sets whose Hausdorff dimension is equal to 2 … Wikipedia
Segment tree — In computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments contain a given point. It is, in principle, a static structure; that is, its content cannot be… … Wikipedia
Euclidean minimum spanning tree — The Euclidean minimum spanning tree or EMST is a minimum spanning tree of a set of points in the plane (or more generally in Bbb{R}^n), where the weight of the edge between each pair of points is the distance between those two points. In simpler… … Wikipedia
Implicit kd-tree — An implicit k d tree is a k d tree defined implicitly above a rectilinear grid. Its splitting planes positions and orientations are not given explicitly but implicitly by some recursive splitting function defined on the hyperrectangles belonging… … Wikipedia
