Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Rafael G. Cano"'
Publikováno v:
Theoretical Computer Science. 789:77-92
Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74cd1f6e60b8a7285866607ad48574a4
https://doi.org/10.1016/j.tcs.2018.08.010
https://doi.org/10.1016/j.tcs.2018.08.010
Publikováno v:
LAGOS
Gallai (1966) conjectured that the edge set of every graph G on n vertices can be covered by at most ⌈n/2⌉ edge-disjoint paths. Such a covering by edge-disjoint paths is called a path decomposition, and the size of a path decomposition with a min
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a87dee6515c1fc7d720d57b5e9548e7a
https://doi.org/10.1016/j.entcs.2019.08.017
https://doi.org/10.1016/j.entcs.2019.08.017
Publikováno v:
Discrete Optimization. 18:87-110
Proportional symbol maps are a cartographic tool that employs scaled symbols to represent data associated with specific locations. The symbols we consider are opaque disks, which may be partially covered by other overlapping disks. We address the pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb19d7c89c09a1ee8426f50b5552001b
https://doi.org/10.1016/j.disopt.2015.09.001
https://doi.org/10.1016/j.disopt.2015.09.001
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783319539249
WALCOM
WALCOM
We study a dynamic labeling problem on rotating maps, i.e., maps that allow for continuous rotations. As the map is rotated, labels must remain horizontally aligned. Rotations may cause labels that were previously disjoint to overlap. For each label,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::828b9bec1d1bb83841133b2f53a3bd81
https://doi.org/10.1007/978-3-319-53925-6_13
https://doi.org/10.1007/978-3-319-53925-6_13
Autor:
Willem Sonke, Thom Castermans, Astrid Pieterse, Bettina Speckmann, Rafael G. Cano, Kevin Buchin
Publikováno v:
ISSUE=31;STARTPAGE=153;ENDPAGE=156;TITLE=31st European Workshop on Computational Geometry (EuroCG 2015)
Computer Graphics Forum, 34(3), 361-370. Wiley-Blackwell
Pure TUe
Computer Graphics Forum, 34(3), 361-370. Wiley-Blackwell
Pure TUe
Cartograms visualize quantitative data about a set of regions such as countries or states. There are several different types of cartograms and -- for some -- algorithms to automatically construct them exist. We focus on mosaic cartograms: cartograms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25945617db63d1bc64f2686f0f999d5d
https://research.tue.nl/nl/publications/240e037e-c79d-44b8-b4bf-1cd1338a4826
https://research.tue.nl/nl/publications/240e037e-c79d-44b8-b4bf-1cd1338a4826
Publikováno v:
Computer Graphics Forum. Jun2015, Vol. 34 Issue 3, pi-xiv. 14p. 1 Color Photograph.
Publikováno v:
ACM Transactions on Intelligent Systems & Technology; 2019, Vol. 10 Issue 1, p1-26, 26p
This book constitutes the proceedings of the 11th International Workshop on Algorithms and Computation, WALCOM 2017, held in Hsinchu, Taiwan, in March 2017. The 35 full papers presented together with three invited talks were carefully reviewed and s