Plane-tree

  • 71London plane — a tall, hardy, widely spreading plane tree, Platanus acerifolia, of North America, having clusters of round, bristly fruit. [1855 60] * * * …

    Universalium

  • 72London plane — noun a hybrid plane tree which is resistant to pollution and widely planted in towns. [Platanus × hispanica.] …

    English new terms dictionary

  • 73Implicit 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

  • 74Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… …

    Wikipedia

  • 75Jay Jay the Jet Plane — is a CGI children s television cartoon fiction series. It has about 60 episodes. The characters are mostly talking airplanes, and a helicopter, and some humans, and two talking ground vehicles, based at a fictional Tarrytown Airport in the USA.… …

    Wikipedia

  • 76Ravnica (plane) — In the card game , Ravnica is the setting for , Guildpact, and , collectively known as the Ravnica block.Ravnica is a , whose primary planet is covered by continuous, sprawling cityscape. This plane is separated from others in the multiverse,… …

    Wikipedia

  • 77Euclidean 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

  • 78Steiner tree problem — Steiner tree for three points A, B, and C (note there are no direct connections between A, B, C). The Steiner point S is located at the Fermat point of the triangle ABC …

    Wikipedia

  • 79Steiner tree — The Steiner tree problem, named after Jakob Steiner, is a problem in combinatorial optimization.The Steiner tree problem is superficially similar to the minimum spanning tree problem: given a set V of points (vertices), interconnect them by a… …

    Wikipedia

  • 80Snakes on a Plane — For the first single from Cobra Starship, see Snakes on a Plane (Bring It). Snakes on a Plane …

    Wikipedia