Choosing Colors for Geometric Graphs via Color Space Embeddings

Details Choosing Colors for Geometric Graphs via Color Space Embeddings Choosing Colors for Geometric Graphs via Color Space Embeddings

2006-09-07

arxiv.org/abs/cs/0609033v1

Computer Science

Computational Geometry

12 pages, 4 figures. To appear at 14th Int. Symp. Graph Drawing, 2006

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Choosing Colors for Geometric Graphs via Color Space Embeddings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Choosing Colors for Geometric Graphs via Color Space Embeddings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Choosing Colors for Geometric Graphs via Color Space Embeddings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-111980