## Abstract

Universal pointsets can be used for visualizing multiple relationships on the same set of objects or for visualizing dynamic graph processes. In simultaneous geometric embeddings, the same point in the plane is used to represent the same object as a way to preserve the viewer's mental map. In colored simultaneous embeddings this restriction is relaxed, by allowing a given object to map to a subset of points in the plane. Specifically, consider a set of graphs on the same set of n vertices partitioned into k colors. Finding a corresponding set of k-colored points in the plane such that each vertex is mapped to a point of the same color so as to allow a straightline plane drawing of each graph is the problem of colored simultaneous geometric embedding.

Original language | English (US) |
---|---|

Pages (from-to) | 569-592 |

Number of pages | 24 |

Journal | Algorithmica (New York) |

Volume | 60 |

Issue number | 3 |

DOIs | |

State | Published - Jul 2011 |

## ASJC Scopus subject areas

- Computer Science(all)
- Computer Science Applications
- Applied Mathematics