52 captures
13 Sep 2006 - 18 Jan 2025
Jun JUL Aug
09
2021 2022 2023
success
fail

About this capture

COLLECTED BY

Organization: Archive Team

Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.

History is littered with hundreds of conflicts over the future of a community, group, location or business that were "resolved" when one of the parties stepped ahead and destroyed what was there. With the original point of contention destroyed, the debates would fall to the wayside. Archive Team believes that by duplicated condemned data, the conversation and debate can continue, as well as the richness and insight gained by keeping the materials. Our projects have ranged in size from a single volunteer downloading the data to a small-but-critical site, to over 100 volunteers stepping forward to acquire terabytes of user-created data to save for future generations.

The main site for Archive Team is at archiveteam.org and contains up to the date information on various projects, manifestos, plans and walkthroughs.

This collection contains the output of many Archive Team projects, both ongoing and completed. Thanks to the generous providing of disk space by the Internet Archive, multi-terabyte datasets can be made available, as well as in use by the Wayback Machine, providing a path back to lost websites and work.

Our collection has grown to the point of having sub-collections for the type of data we acquire. If you are seeking to browse the contents of these collections, the Wayback Machine is the best first stop. Otherwise, you are free to dig into the stacks to see what you may find.

The Archive Team Panic Downloads are full pulldowns of currently extant websites, meant to serve as emergency backups for needed sites that are in danger of closing, or which will be missed dearly if suddenly lost due to hard drive crashes or server failures.

Collection: Archive Team: URLs

TIMESTAMPS

The Wayback Machine - http://web.archive.org/web/20220709055629/http://en.wikipedia.org/wiki/HyperbolicTree
 





Hyperbolic tree



From Wikipedia, the free encyclopedia

  (Redirected from HyperbolicTree)


Jump to navigation  Jump to search  

Ahyperbolic tree (often shortened as hypertree) is an information visualization and graph drawing method inspired by hyperbolic geometry.

A basic hyperbolic tree. Nodes in focus are placed in the center and given more room, while out-of-focus nodes are compressed near the boundaries.
Focusing on a different node brings it and its children to the center of the disk, while uninteresting portions of the tree are compressed.

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 trees with more branching 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.[1] 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.

Hyperbolic trees were patented in the U.S. by Xerox in 1996, but the patent has since expired.[2]

See also[edit]

References[edit]

  1. ^ Lamping, John Ogden; Rao, Ramana; Pirolli, Peter (May 1995). A focus+context technique based on hyperbolic geometry for visualizing large hierarchies. Proceedings of the ACM Conference on Human Factors in Computing Systems (CHI 1995). pp. 401–408. doi:10.1145/223904.223956. Archived from the original on 2017-05-10. Retrieved 2021-04-13.
  • ^ US patent 5590250, Lamping; John O. & Rao; Ramana B., "Layout of node-link structures in space with negative curvature", assigned to Xerox Corporation 
  • External links[edit]

    Retrieved from "https://en.wikipedia.org/w/index.php?title=Hyperbolic_tree&oldid=1093970967"

    Categories: 
    Hyperbolic geometry
    Graph drawing
    Trees (data structures)
    Hidden categories: 
    Articles with short description
    Short description matches Wikidata
    Commons category link is on Wikidata
     


    Navigation menu


    Personal tools  



    Not logged in
    Talk
    Contributions
    Create account
    Log in
     

    Namespaces  



    Article
    Talk