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 journalArticle

7 Citations (Scopus)

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

Fingerprint

Point Sets
Drawing (graphics)
Color
Dynamic Graphs
Graph in graph theory
Restriction
Subset
Vertex of a graph
Object

ASJC Scopus subject areas

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

Cite this

Brandes, U., Erten, C., Estrella-Balderrama, A., Fowler, J. J., Frati, F., Geyer, M., ... Symvonis, A. (2011). Colored simultaneous geometric embeddings and universal pointsets. Algorithmica, 60(3), 569-592. https://doi.org/10.1007/s00453-010-9433-x

Colored simultaneous geometric embeddings and universal pointsets. / Brandes, Ulrik; Erten, Cesim; Estrella-Balderrama, Alejandro; Fowler, J. Joseph; Frati, Fabrizio; Geyer, Markus; Gutwenger, Carsten; Hong, Seok Hee; Kaufmann, Michael; Kobourov, Stephen G; Liotta, Giuseppe; Mutzel, Petra; Symvonis, Antonios.

In: Algorithmica, Vol. 60, No. 3, 07.2011, p. 569-592.

Research output: Contribution to journalArticle

Brandes, U, Erten, C, Estrella-Balderrama, A, Fowler, JJ, Frati, F, Geyer, M, Gutwenger, C, Hong, SH, Kaufmann, M, Kobourov, SG, Liotta, G, Mutzel, P & Symvonis, A 2011, 'Colored simultaneous geometric embeddings and universal pointsets', Algorithmica, vol. 60, no. 3, pp. 569-592. https://doi.org/10.1007/s00453-010-9433-x
Brandes U, Erten C, Estrella-Balderrama A, Fowler JJ, Frati F, Geyer M et al. Colored simultaneous geometric embeddings and universal pointsets. Algorithmica. 2011 Jul;60(3):569-592. https://doi.org/10.1007/s00453-010-9433-x
Brandes, Ulrik ; Erten, Cesim ; Estrella-Balderrama, Alejandro ; Fowler, J. Joseph ; Frati, Fabrizio ; Geyer, Markus ; Gutwenger, Carsten ; Hong, Seok Hee ; Kaufmann, Michael ; Kobourov, Stephen G ; Liotta, Giuseppe ; Mutzel, Petra ; Symvonis, Antonios. / Colored simultaneous geometric embeddings and universal pointsets. In: Algorithmica. 2011 ; Vol. 60, No. 3. pp. 569-592.
@article{44444b4a6f894de587adff5edfffb89c,
title = "Colored simultaneous geometric embeddings and universal pointsets",
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.",
author = "Ulrik Brandes and Cesim Erten and Alejandro Estrella-Balderrama and Fowler, {J. Joseph} and Fabrizio Frati and Markus Geyer and Carsten Gutwenger and Hong, {Seok Hee} and Michael Kaufmann and Kobourov, {Stephen G} and Giuseppe Liotta and Petra Mutzel and Antonios Symvonis",
year = "2011",
month = "7",
doi = "10.1007/s00453-010-9433-x",
language = "English (US)",
volume = "60",
pages = "569--592",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - Colored simultaneous geometric embeddings and universal pointsets

AU - Brandes, Ulrik

AU - Erten, Cesim

AU - Estrella-Balderrama, Alejandro

AU - Fowler, J. Joseph

AU - Frati, Fabrizio

AU - Geyer, Markus

AU - Gutwenger, Carsten

AU - Hong, Seok Hee

AU - Kaufmann, Michael

AU - Kobourov, Stephen G

AU - Liotta, Giuseppe

AU - Mutzel, Petra

AU - Symvonis, Antonios

PY - 2011/7

Y1 - 2011/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79958286971&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79958286971&partnerID=8YFLogxK

U2 - 10.1007/s00453-010-9433-x

DO - 10.1007/s00453-010-9433-x

M3 - Article

VL - 60

SP - 569

EP - 592

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 3

ER -