Hyperbolic tree
A hyperbolic tree (often shortened as hypertree) is an information visualization and graph drawing method inspired by hyperbolic geometry. Displaying hierarchical data as a tree suffers from visual clutter as the number of nodes per level can grow exponentially. For a simple binary tree, the maximum number of nodes at a level n is 2n, while the number of nodes for larger trees grows much more quickly. Drawing the tree as a node-link diagram thus requires exponential amounts of space to be displayed. Hyperbolic trees have been patented in the U.S. by Xerox.
Wikipage redirect
primaryTopic
Hyperbolic tree
A hyperbolic tree (often shortened as hypertree) is an information visualization and graph drawing method inspired by hyperbolic geometry. Displaying hierarchical data as a tree suffers from visual clutter as the number of nodes per level can grow exponentially. For a simple binary tree, the maximum number of nodes at a level n is 2n, while the number of nodes for larger trees grows much more quickly. Drawing the tree as a node-link diagram thus requires exponential amounts of space to be displayed. Hyperbolic trees have been patented in the U.S. by Xerox.
has abstract
A hyperbolic tree (often short ...... patented in the U.S. by Xerox.
@en
Árvore hiperbólica (em inglês: ...... ido por Lamping et al em 1995.
@pt
thumbnail
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
702,146,877
hypernym
type
comment
A hyperbolic tree (often short ...... patented in the U.S. by Xerox.
@en
Árvore hiperbólica (em inglês: ...... ido por Lamping et al em 1995.
@pt
label
Hyperbolic tree
@en
Árvore hiperbólica
@pt