![]() ![]() The layout algorithm is based on the work of Yee and his associates, and the underlying mechanics have been further described in papers and talks at conferences on Information visualization, on Museums and the Web, and on distance education. The algorithm was developed by Michael Douma and colleagues at, starting in 2005. There is a "focus" node, and users change focus from node to node. ![]() Nodes can contain any content (formatted text, images, videos, etc.) or links to other nodes or content. The layout is adaptive, changing as the user clicks from node to node, to minimize cluttering. Key aspects of the method are publicly described. It also uses an approach similar to hyperbolic trees to reduce sizes far from the focus node. SpicyNodes is a radial tree layout engine, modified using force-based algorithms, bias controls, and variable pivot point. Too few, and the layout becomes a string of pearls. A typical implementation requires an average of 2-10 linked/child nodes per node.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |