Colored simultaneous geometric embeddings and universal pointsets

Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


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 languageEnglish (US)
Pages (from-to)569-592
Number of pages24
JournalAlgorithmica (New York)
Issue number3
StatePublished - Jul 2011

ASJC Scopus subject areas

  • General Computer Science
  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'Colored simultaneous geometric embeddings and universal pointsets'. Together they form a unique fingerprint.

Cite this