DBpedia – Linked Data Fragments

Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Hyperbolic_tree> ?p ?o }

• Hyperbolic_tree abstract "A hyperbolic tree (often shortened as hypertree) in Web development jargon and information visualization, defines a 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.One approach is to use a hyperbolic tree, first introduced by Lamping et al. Hyperbolic trees employ hyperbolic space, which intrinsically has "more room" than Euclidean space. For instance, linearly increasing the radius of a circle in Euclidean space increases its circumference linearly, while the same circle in hyperbolic space would have its circumference increase exponentially. Exploiting this property allows laying out the tree in hyperbolic space in an uncluttered manner: placing a node far enough from its parent gives the node almost the same amount of space as its parent for laying out its own children.Displaying a hyperbolic tree commonly utilizes the Poincaré disk model of hyperbolic geometry, though the Klein-Beltrami model can also be used. Both display the entire hyperbolic plane within a unit disk, making the entire tree visible at once. The unit disk gives a fish-eye lens view of the plane, giving more emphasis to nodes which are in focus and displaying nodes further out of focus closer to the boundary of the disk. Traversing the hyperbolic tree requires Möbius transformations of the space, bringing new nodes into focus and moving higher levels of the hierarchy out of view.Although hyperbolic trees have been patented in the U.S. by Xerox, various Java & JavaScript implementations exist on the web as well as C++ & OpenGL.".
• Hyperbolic_tree thumbnail BasicTree.png?width=300.
• Hyperbolic_tree wikiPageExternalLink lamping95focuscontext.html.
• Hyperbolic_tree wikiPageExternalLink hypergraph.sourceforge.net.
• Hyperbolic_tree wikiPageExternalLink index.html.
• Hyperbolic_tree wikiPageExternalLink jl_bdy.htm.
• Hyperbolic_tree wikiPageExternalLink thejit.org.
• Hyperbolic_tree wikiPageExternalLink treevis.net.
• Hyperbolic_tree wikiPageExternalLink map2.html.
• Hyperbolic_tree wikiPageExternalLink www.touchgraph.com.
• Hyperbolic_tree wikiPageExternalLink vc.
• Hyperbolic_tree wikiPageExternalLink screenshots.
• Hyperbolic_tree wikiPageID "5566181".
• Hyperbolic_tree wikiPageRevisionID "640507566".
• Hyperbolic_tree hasPhotoCollection Hyperbolic_tree.
• Hyperbolic_tree subject Category:Graph_drawing.
• Hyperbolic_tree subject Category:Hyperbolic_geometry.
• Hyperbolic_tree subject Category:Trees_(data_structures).
• Hyperbolic_tree comment "A hyperbolic tree (often shortened as hypertree) in Web development jargon and information visualization, defines a 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.".
• Hyperbolic_tree label "Hyperbolic tree".
• Hyperbolic_tree label "Árvore hiperbólica".
• Hyperbolic_tree sameAs Árvore_hiperbólica.
• Hyperbolic_tree sameAs m.0dswbv.
• Hyperbolic_tree sameAs Q574023.
• Hyperbolic_tree sameAs Q574023.
• Hyperbolic_tree wasDerivedFrom Hyperbolic_tree?oldid=640507566.
• Hyperbolic_tree depiction BasicTree.png.
• Hyperbolic_tree isPrimaryTopicOf Hyperbolic_tree.