Using Colors in Process Diagrams – From Color Theory to Automated Coloring Support
نویسنده
چکیده
Process diagrams as a means to visualize or model dynamic aspects (e.g. work practices or business processes) of an organization can be considered a common practice in modern organizations. While shape and orientation of graphical elements in process diagrams are largely prescribed by the modeling notation (and the implementation of this standard in the software tool) the actual color, texture, size and position of elements is left to the (often unskilled) hands of a modeler. Similarly state-of-theart process modeling tools offer only very limited guidance for a modeler in choosing colors that are aesthetically pleasing and at the same time facilitate readability and understandability of process diagrams. In this paper, we present an approach that takes into account the aspects a process diagram reflects to derive aesthetically pleasing sets of colors to be applied to diagram elements. Finally, we describe the exemplary implementation of this approach in an assistive color selection feature in a process modeling environment.
منابع مشابه
الگوریتم ژنتیک با جهش آشوبی هوشمند و ترکیب چندنقطهای مکاشفهای برای حل مسئله رنگآمیزی گراف
Graph coloring is a way of coloring the vertices of a graph such that no two adjacent vertices have the same color. Graph coloring problem (GCP) is about finding the smallest number of colors needed to color a given graph. The smallest number of colors needed to color a graph G, is called its chromatic number. GCP is a well-known NP-hard problems and, therefore, heuristic algorithms are usually...
متن کاملOn the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کاملColor spectra and coloring conjectures
In this article we take up the calculation of the minimum number of colors needed to produce a non-trivial coloring of a knot. This is a knot invariant and we use the torus knots of type (2, n) as our case study. We calculate the minima in some cases. In other cases we estimate upper bounds for these minima leaning on the features of modular arithmetic. We introduce a sequence of transformation...
متن کاملb-coloring in Square of Cartesian Product of Two Cycles
A b-coloring of a graph G with k colors is a proper coloring of G using k colors in which each color class contains a color dominating vertex, that is, a vertex which has at least one neighbor in each of the other color classes. The largest integer k(>0) for which G has a b-coloring using k colors is the b-chromatic number b(G) of G. In this paper, we obtain the b-chromatic number of the square...
متن کاملLecture 6: Graph Coloring Using Path Coupling
In this lecture we use coupling to design a Markov chain to generate a uniform random proper coloring of a graph with q colors. Recall that a coloring of vertices of G with q colors is proper if any two adjacent vertices have distinct colors. Let G be a graph with maximum degree ∆. Obviously, any such graph has a coloring with q = ∆ + 1 colors: Greedily color every vertex with a color with is n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015