Colored spanning graphs for set visualization

  title={Colored spanning graphs for set visualization},
  author={Ferran Hurtado and Matias Korman and Marc J. van Kreveld and Maarten L{\"o}ffler and Vera Sacrist{\'a}n Adinolfi and Akiyoshi Shioura and Rodrigo I. Silveira and Bettina Speckmann and Takeshi Tokuyama},
  journal={Comput. Geom.},
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… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS


Publications referenced by this paper.
Showing 1-10 of 23 references

Steiner minimal trees

  • E. Gilbert, H. Pollak
  • SIAM J. Appl. Math. 16, 1–29
  • 1968
Highly Influential
4 Excerpts

A new bound for Euclidean Steiner minimum trees

  • F. Chung, R. Graham
  • Ann. N.Y. Acad. Sci. 440, 328–346
  • 1986
Highly Influential
2 Excerpts

Similar Papers

Loading similar papers…