Highly Influenced

# Colored spanning graphs for set visualization

@article{Hurtado2018ColoredSG, 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.}, year={2018}, volume={68}, pages={262-276} }

- Published 2018 in Comput. Geom.
DOI:10.1016/j.comgeo.2017.06.006

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