Colored spanning graphs for set visualization
Visualitza/Obre
10.1016/j.comgeo.2017.06.006
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/115386
Tipus de documentArticle
Data publicació2018-03
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
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 can be solved in polynomial time using matroid techniques. In addition, we discuss more efficient algorithms for the case in which points are located on a line or a circle, and also describe a fast (12¿+1)-approximation algorithm, where ¿ is the Steiner ratio.
CitacióHurtado, F., Korman, M., Van Kreveld, M., Löffler, M., Sacristán, V., Shioura, A., Silveira, R.I., Speckmann, B., Tokuyama, T. Colored spanning graphs for set visualization. "Computational geometry: theory and applications", Març 2018, vol. 68, p. 262-276.
ISSN0925-7721
Altres identificadorshttps://arxiv.org/abs/1603.00580
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
purple-journal.pdf | 483,0Kb | Visualitza/Obre |