• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Graph Drawing; Lecture Notes in Computer Science; 4372 >Choosing Colors for Geometric Graphs Via Color Space Embeddings
【24h】

Choosing Colors for Geometric Graphs Via Color Space Embeddings

机译：通过颜色空间嵌入为几何图选择颜色

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

摘要

Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. After the geometric embedding is specified, there is an additional step that is often overlooked or ignored: assigning display colors to the graph's vertices. We study the additional aesthetic criterion of assigning distinct colors to vertices of a geometric graph so that the colors assigned to adjacent vertices are as different from one another as possible. We formulate this as a problem involving perceptual metrics in color space and we develop algorithms for solving this problem by embedding the graph in color space. We also present an application of this work to a distributed load-balancing visualization problem.
机译：传统上，图形绘图研究着重于生成满足各种美学约束的图形的几何嵌入。指定几何嵌入后，还有一个通常被忽略或忽略的附加步骤：为图形的顶点分配显示颜色。我们研究了为几何图形的顶点分配不同的颜色的附加审美准则，以便分配给相邻顶点的颜色尽可能彼此不同。我们将其表述为涉及色彩空间中感知指标的问题，并且我们开发了通过将图形嵌入色彩空间来解决此问题的算法。我们还介绍了这项工作在分布式负载平衡可视化问题中的应用。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号