Colored spanning graphs for set visualization

Ferran Hurtado; Cozzetti Matias Korman; Marc Van Kreveld; Maarten Löffler; Vera Sacristán; Rodrigo I. Silveira; Bettina Speckmann

doi:10.1007/978-3-319-03841-4-25

Colored spanning graphs for set visualization

Ferran Hurtado, Cozzetti Matias Korman, Marc Van Kreveld, Maarten Löffler, Vera Sacristán, Rodrigo I. Silveira, Bettina Speckmann

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

10 Citations (Scopus)

Abstract

We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the blue set, red points belong exclusively to the red set, and purple points belong to both sets. A red-blue-purple spanning graph (RBP spanning graph) is a set of edges connecting the points such that the subgraph induced by the red and purple points is connected, and the subgraph induced by the blue and purple points is connected. We study the geometric properties of minimum RBP spanning graphs and the algorithmic problems associated with computing them. Specifically, we show that the general problem is NP-hard. Hence we give an (1/2ρ+1)- approximation, where ρ is the Steiner ratio. We also present efficient exact solutions if the points are located on a line or a circle. Finally we consider extensions to more than two sets.

Original language	English
Title of host publication	Graph Drawing - 21st International Symposium, GD 2013, Revised Selected Papers
Pages	280-291
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-319-03841-4-25
Publication status	Published - 2013 Dec 1
Externally published	Yes
Event	21st International Symposium on Graph Drawing, GD 2013 - Bordeaux, France Duration: 2013 Sep 23 → 2013 Sep 25

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8242 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	21st International Symposium on Graph Drawing, GD 2013
Country	France
City	Bordeaux
Period	13/9/23 → 13/9/25

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-03841-4-25

Fingerprint Dive into the research topics of 'Colored spanning graphs for set visualization'. Together they form a unique fingerprint.

Cite this

Hurtado, F., Korman, C. M., Van Kreveld, M., Löffler, M., Sacristán, V., Silveira, R. I., & Speckmann, B. (2013). Colored spanning graphs for set visualization. In Graph Drawing - 21st International Symposium, GD 2013, Revised Selected Papers (pp. 280-291). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8242 LNCS). https://doi.org/10.1007/978-3-319-03841-4-25

Colored spanning graphs for set visualization. / Hurtado, Ferran; Korman, Cozzetti Matias; Van Kreveld, Marc; Löffler, Maarten; Sacristán, Vera; Silveira, Rodrigo I.; Speckmann, Bettina.

Graph Drawing - 21st International Symposium, GD 2013, Revised Selected Papers. 2013. p. 280-291 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8242 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Hurtado, F, Korman, CM, Van Kreveld, M, Löffler, M, Sacristán, V, Silveira, RI & Speckmann, B 2013, Colored spanning graphs for set visualization. in Graph Drawing - 21st International Symposium, GD 2013, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8242 LNCS, pp. 280-291, 21st International Symposium on Graph Drawing, GD 2013, Bordeaux, France, 13/9/23. https://doi.org/10.1007/978-3-319-03841-4-25

Hurtado F, Korman CM, Van Kreveld M, Löffler M, Sacristán V, Silveira RI et al. Colored spanning graphs for set visualization. In Graph Drawing - 21st International Symposium, GD 2013, Revised Selected Papers. 2013. p. 280-291. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-03841-4-25

Hurtado, Ferran ; Korman, Cozzetti Matias ; Van Kreveld, Marc ; Löffler, Maarten ; Sacristán, Vera ; Silveira, Rodrigo I. ; Speckmann, Bettina. / Colored spanning graphs for set visualization. Graph Drawing - 21st International Symposium, GD 2013, Revised Selected Papers. 2013. pp. 280-291 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{95c3cf32d6d74438ba80986a8f955735,

title = "Colored spanning graphs for set visualization",

abstract = "We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the blue set, red points belong exclusively to the red set, and purple points belong to both sets. A red-blue-purple spanning graph (RBP spanning graph) is a set of edges connecting the points such that the subgraph induced by the red and purple points is connected, and the subgraph induced by the blue and purple points is connected. We study the geometric properties of minimum RBP spanning graphs and the algorithmic problems associated with computing them. Specifically, we show that the general problem is NP-hard. Hence we give an (1/2ρ+1)- approximation, where ρ is the Steiner ratio. We also present efficient exact solutions if the points are located on a line or a circle. Finally we consider extensions to more than two sets.",

author = "Ferran Hurtado and Korman, {Cozzetti Matias} and {Van Kreveld}, Marc and Maarten L{\"o}ffler and Vera Sacrist{\'a}n and Silveira, {Rodrigo I.} and Bettina Speckmann",

year = "2013",

month = dec,

day = "1",

doi = "10.1007/978-3-319-03841-4-25",

language = "English",

isbn = "9783319038407",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "280--291",

booktitle = "Graph Drawing - 21st International Symposium, GD 2013, Revised Selected Papers",

note = "21st International Symposium on Graph Drawing, GD 2013 ; Conference date: 23-09-2013 Through 25-09-2013",

}

TY - GEN

T1 - Colored spanning graphs for set visualization

AU - Hurtado, Ferran

AU - Korman, Cozzetti Matias

AU - Van Kreveld, Marc

AU - Löffler, Maarten

AU - Sacristán, Vera

AU - Silveira, Rodrigo I.

AU - Speckmann, Bettina

PY - 2013/12/1

Y1 - 2013/12/1

N2 - We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the blue set, red points belong exclusively to the red set, and purple points belong to both sets. A red-blue-purple spanning graph (RBP spanning graph) is a set of edges connecting the points such that the subgraph induced by the red and purple points is connected, and the subgraph induced by the blue and purple points is connected. We study the geometric properties of minimum RBP spanning graphs and the algorithmic problems associated with computing them. Specifically, we show that the general problem is NP-hard. Hence we give an (1/2ρ+1)- approximation, where ρ is the Steiner ratio. We also present efficient exact solutions if the points are located on a line or a circle. Finally we consider extensions to more than two sets.

AB - We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the blue set, red points belong exclusively to the red set, and purple points belong to both sets. A red-blue-purple spanning graph (RBP spanning graph) is a set of edges connecting the points such that the subgraph induced by the red and purple points is connected, and the subgraph induced by the blue and purple points is connected. We study the geometric properties of minimum RBP spanning graphs and the algorithmic problems associated with computing them. Specifically, we show that the general problem is NP-hard. Hence we give an (1/2ρ+1)- approximation, where ρ is the Steiner ratio. We also present efficient exact solutions if the points are located on a line or a circle. Finally we consider extensions to more than two sets.

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

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

U2 - 10.1007/978-3-319-03841-4-25

DO - 10.1007/978-3-319-03841-4-25

M3 - Conference contribution

AN - SCOPUS:84891864548

SN - 9783319038407

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 280

EP - 291

BT - Graph Drawing - 21st International Symposium, GD 2013, Revised Selected Papers

T2 - 21st International Symposium on Graph Drawing, GD 2013

Y2 - 23 September 2013 through 25 September 2013

ER -