In this paper we explore the algorithmic questions that arise when computing spanning graphs for set visualization which are optimal with respect to ink usage.

We study the geometric properties of minimum RBP spanning graphs and the algorithmic problems associated with computing them. Specifically, we show that the ...

Mar 2, 2016 · We study the geometric properties of minimum RBP spanning graphs and the algorithmic problems associated with computing them. Specifically, we ...

Colored spanning graphs for set visualization. Computational Geometry, 68, 262-276. https://doi.org/10.1016/j.comgeo.2017.06.006. DOI: 10.1016/j.comgeo ...

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

Abstract. We study an algorithmic problem that is motivated by ink minimiza- tion for sparse set visualizations. Our input is a set of points in the plane ...

We study the geometric properties of minimum RBP spanning graphs and the algorithmic problems associated with computing them. Specifically, we show that the ...

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

This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing.

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