Mostra el registre d'ítem simple
Colored spanning graphs for set visualization
dc.contributor.author | Hurtado Díaz, Fernando Alfredo |
dc.contributor.author | Korman, Matias |
dc.contributor.author | Van Kreveld, Matias |
dc.contributor.author | Löffler, Maarten |
dc.contributor.author | Sacristán Adinolfi, Vera |
dc.contributor.author | Shioura, Akiyoshi |
dc.contributor.author | Silveira, Rodrigo Ignacio |
dc.contributor.author | Speckmann, Bettina |
dc.contributor.author | Tokuyama, Takeshi |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2018-03-19T10:28:12Z |
dc.date.available | 2019-03-01T01:30:30Z |
dc.date.issued | 2018-03 |
dc.identifier.citation | 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. |
dc.identifier.issn | 0925-7721 |
dc.identifier.other | https://arxiv.org/abs/1603.00580 |
dc.identifier.uri | http://hdl.handle.net/2117/115386 |
dc.description.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. |
dc.format.extent | 15 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica |
dc.subject.lcsh | Numerical analysis |
dc.subject.lcsh | Algebra, Homological |
dc.subject.other | Approximation |
dc.subject.other | Colored point set |
dc.subject.other | Matroid intersection |
dc.subject.other | Minimum spanning tree |
dc.subject.other | Set visualization |
dc.title | Colored spanning graphs for set visualization |
dc.type | Article |
dc.subject.lemac | Anàlisi numèrica |
dc.subject.lemac | Àlgebra homològica |
dc.contributor.group | Universitat Politècnica de Catalunya. DCG - Discrete and Combinatorial Geometry |
dc.identifier.doi | 10.1016/j.comgeo.2017.06.006 |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::65 Numerical analysis::65D Numerical approximation and computational geometry |
dc.subject.ams | Classificació AMS::55 Algebraic topology::55U Applied homological algebra and category theory |
dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S0925772117300585?via%3Dihub |
dc.rights.access | Open Access |
local.identifier.drac | 21531948 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Hurtado, F.; Korman, M.; Van Kreveld, M.; Löffler, M.; Sacristán, V.; Shioura, A.; Silveira, R.I.; Speckmann, B.; Tokuyama, T. |
local.citation.publicationName | Computational geometry: theory and applications |
local.citation.volume | 68 |
local.citation.startingPage | 262 |
local.citation.endingPage | 276 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [29]
-
Articles de revista [3.269]