...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Computer Graphics and Applications >Exploring large graphs in 3D hyperbolic space
【24h】

Exploring large graphs in 3D hyperbolic space

机译：探索3D双曲空间中的大图

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Drawing graphs as nodes connected by links is visually compelling but computationally difficult. Hyperbolic space and spanning trees can reduce visual clutter, speed up layout, and provide fluid interaction. This article briefly describes a software system that explicitly attempts to handle much larger graphs than previous systems and support dynamic exploration rather than final presentation. It then discusses the applicability of this system to goals beyond simple exploration. A software system that supports graph exploration should include both a layout and an interactive drawing component. I have developed new algorithms for both layout and drawing (H3 and H3Viewer). The H3Viewer drawing algorithm remains under development, so this article presents preliminary results. I have implemented a software library that uses these algorithms. It can handle graphs of more than 100,000 edges by using a spanning tree as the backbone for the layout and drawing algorithms.
机译：将图形绘制为通过链接连接的节点在视觉上引人注目，但计算困难。双曲空间和生成树可以减少视觉混乱，加快布局并提供流畅的交互。本文简要介绍了一个软件系统，该系统明确尝试处理比以前的系统更大的图，并支持动态探索而不是最终演示。然后讨论了该系统对简单探索之外的目标的适用性。支持图形浏览的软件系统应同时包括布局和交互式绘图组件。我已经为布局和图形（H3和H3Viewer）开发了新的算法。 H3Viewer绘图算法仍在开发中，因此本文提供了初步结果。我已经实现了使用这些算法的软件库。通过使用生成树作为布局和绘制算法的主干，它可以处理超过100,000个边的图形。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号