Algorithms for Consistent Dynamic Labeling of Maps With a Time-Slider Interface
User interfaces for inspecting spatio-temporal events often allow their users to filter the events by specifying a time window with a time slider. We consider the case that filtered events are visualized on a map using textual or iconic labels. However, to ensure a clear visualization, not all filte...
Uložené v:
| Vydané v: | IEEE transactions on visualization and computer graphics Ročník 31; číslo 10; s. 6691 - 6704 |
|---|---|
| Hlavní autori: | , , , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
United States
IEEE
01.10.2025
|
| Predmet: | |
| ISSN: | 1077-2626, 1941-0506, 1941-0506 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | User interfaces for inspecting spatio-temporal events often allow their users to filter the events by specifying a time window with a time slider. We consider the case that filtered events are visualized on a map using textual or iconic labels. However, to ensure a clear visualization, not all filtered events are annotated with a label. We present algorithms for setting up a data structure that encodes for every possible time window the set of displayed labels. Our algorithms ensure that the displayed labels never overlap and guarantee the stability of the labeling during certain basic interactions with the time slider. Assuming that the labels have different priorities (weights), we aim to maximize the weight of the displayed labels integrated over all possible time windows. As basic interactions, we consider moving the entire time window, symmetrically scaling it, and dragging one of its endpoints. We consider two stability requirements: (1) during a basic interaction, a label should appear and disappear at most once; (2) if a label is displayed for a time window <inline-formula><tex-math notation="LaTeX">Q</tex-math> <mml:math><mml:mi>Q</mml:mi></mml:math><inline-graphic xlink:href="bonerath-ieq1-3527582.gif"/> </inline-formula>, then it is also displayed for all the time windows contained in <inline-formula><tex-math notation="LaTeX">Q</tex-math> <mml:math><mml:mi>Q</mml:mi></mml:math><inline-graphic xlink:href="bonerath-ieq2-3527582.gif"/> </inline-formula> and that contain its timestamp. We prove that finding an optimal solution is NP-hard and propose efficient constant-factor approximation algorithms for unit-square and unit-disk labels, as well as a fast greedy heuristic for arbitrarily shaped labels. In experiments on real-world data, we compare the non-exact algorithms with an exact approach through integer linear programming. |
|---|---|
| AbstractList | User interfaces for inspecting spatio-temporal events often allow their users to filter the events by specifying a time window with a time slider. We consider the case that filtered events are visualized on a map using textual or iconic labels. However, to ensure a clear visualization, not all filtered events are annotated with a label. We present algorithms for setting up a data structure that encodes for every possible time window the set of displayed labels. Our algorithms ensure that the displayed labels never overlap and guarantee the stability of the labeling during certain basic interactions with the time slider. Assuming that the labels have different priorities (weights), we aim to maximize the weight of the displayed labels integrated over all possible time windows. As basic interactions, we consider moving the entire time window, symmetrically scaling it, and dragging one of its endpoints. We consider two stability requirements: (1) during a basic interaction, a label should appear and disappear at most once; (2) if a label is displayed for a time window $Q$Q, then it is also displayed for all the time windows contained in $Q$Q and that contain its timestamp. We prove that finding an optimal solution is NP-hard and propose efficient constant-factor approximation algorithms for unit-square and unit-disk labels, as well as a fast greedy heuristic for arbitrarily shaped labels. In experiments on real-world data, we compare the non-exact algorithms with an exact approach through integer linear programming.User interfaces for inspecting spatio-temporal events often allow their users to filter the events by specifying a time window with a time slider. We consider the case that filtered events are visualized on a map using textual or iconic labels. However, to ensure a clear visualization, not all filtered events are annotated with a label. We present algorithms for setting up a data structure that encodes for every possible time window the set of displayed labels. Our algorithms ensure that the displayed labels never overlap and guarantee the stability of the labeling during certain basic interactions with the time slider. Assuming that the labels have different priorities (weights), we aim to maximize the weight of the displayed labels integrated over all possible time windows. As basic interactions, we consider moving the entire time window, symmetrically scaling it, and dragging one of its endpoints. We consider two stability requirements: (1) during a basic interaction, a label should appear and disappear at most once; (2) if a label is displayed for a time window $Q$Q, then it is also displayed for all the time windows contained in $Q$Q and that contain its timestamp. We prove that finding an optimal solution is NP-hard and propose efficient constant-factor approximation algorithms for unit-square and unit-disk labels, as well as a fast greedy heuristic for arbitrarily shaped labels. In experiments on real-world data, we compare the non-exact algorithms with an exact approach through integer linear programming. User interfaces for inspecting spatio-temporal events often allow their users to filter the events by specifying a time window with a time slider. We consider the case that filtered events are visualized on a map using textual or iconic labels. However, to ensure a clear visualization, not all filtered events are annotated with a label. We present algorithms for setting up a data structure that encodes for every possible time window the set of displayed labels. Our algorithms ensure that the displayed labels never overlap and guarantee the stability of the labeling during certain basic interactions with the time slider. Assuming that the labels have different priorities (weights), we aim to maximize the weight of the displayed labels integrated over all possible time windows. As basic interactions, we consider moving the entire time window, symmetrically scaling it, and dragging one of its endpoints. We consider two stability requirements: (1) during a basic interaction, a label should appear and disappear at most once; (2) if a label is displayed for a time window $Q$Q, then it is also displayed for all the time windows contained in $Q$Q and that contain its timestamp. We prove that finding an optimal solution is NP-hard and propose efficient constant-factor approximation algorithms for unit-square and unit-disk labels, as well as a fast greedy heuristic for arbitrarily shaped labels. In experiments on real-world data, we compare the non-exact algorithms with an exact approach through integer linear programming. User interfaces for inspecting spatio-temporal events often allow their users to filter the events by specifying a time window with a time slider. We consider the case that filtered events are visualized on a map using textual or iconic labels. However, to ensure a clear visualization, not all filtered events are annotated with a label. We present algorithms for setting up a data structure that encodes for every possible time window the set of displayed labels. Our algorithms ensure that the displayed labels never overlap and guarantee the stability of the labeling during certain basic interactions with the time slider. Assuming that the labels have different priorities (weights), we aim to maximize the weight of the displayed labels integrated over all possible time windows. As basic interactions, we consider moving the entire time window, symmetrically scaling it, and dragging one of its endpoints. We consider two stability requirements: (1) during a basic interaction, a label should appear and disappear at most once; (2) if a label is displayed for a time window <inline-formula><tex-math notation="LaTeX">Q</tex-math> <mml:math><mml:mi>Q</mml:mi></mml:math><inline-graphic xlink:href="bonerath-ieq1-3527582.gif"/> </inline-formula>, then it is also displayed for all the time windows contained in <inline-formula><tex-math notation="LaTeX">Q</tex-math> <mml:math><mml:mi>Q</mml:mi></mml:math><inline-graphic xlink:href="bonerath-ieq2-3527582.gif"/> </inline-formula> and that contain its timestamp. We prove that finding an optimal solution is NP-hard and propose efficient constant-factor approximation algorithms for unit-square and unit-disk labels, as well as a fast greedy heuristic for arbitrarily shaped labels. In experiments on real-world data, we compare the non-exact algorithms with an exact approach through integer linear programming. |
| Author | Driemel, Anne Haunert, Jan-Henrik Haverkort, Herman Niedermann, Benjamin Bonerath, Annika Langetepe, Elmar |
| Author_xml | – sequence: 1 givenname: Annika orcidid: 0000-0002-8427-3246 surname: Bonerath fullname: Bonerath, Annika email: bonerath@igg.uni-bonn.de organization: University of Bonn, Bonn, Germany – sequence: 2 givenname: Anne surname: Driemel fullname: Driemel, Anne organization: University of Bonn, Bonn, Germany – sequence: 3 givenname: Jan-Henrik surname: Haunert fullname: Haunert, Jan-Henrik email: haunert@igg.uni-bonn.de organization: University of Bonn, Bonn, Germany – sequence: 4 givenname: Herman surname: Haverkort fullname: Haverkort, Herman organization: University of Bonn, Bonn, Germany – sequence: 5 givenname: Elmar surname: Langetepe fullname: Langetepe, Elmar organization: University of Bonn, Bonn, Germany – sequence: 6 givenname: Benjamin orcidid: 0000-0001-6638-7250 surname: Niedermann fullname: Niedermann, Benjamin organization: yWorks GmbH, Tübingen, Germany |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/40030894$$D View this record in MEDLINE/PubMed |
| BookMark | eNpN0EtPGzEQwHELgQpJ-wGQEPKRy6bjV7w-ovCUUuVA2h5XXnsMRvsI9ubAt2ejBMTJc_jNWPpPyHHXd0jIOYMZY2B-r_8t7mccuJoJxbUq-RE5Y0ayAhTMj8cZtC74nM9PySTnVwAmZWl-kFMJIKA08oysrpvnPsXhpc009Iku-i7HPGA30Jv3zrbR0aWtsYndM-0D_WM3mf4fObV0HVssnproMdHHbsAUrMOf5CTYJuOvwzslf-9u14uHYrm6f1xcLwsnmB4KL9DVoEwoLffWaslNyQG9N0Y4LoOplbaWC82D1sp45xBsyYQ3wddKoJiSq_3dTerftpiHqo3ZYdPYDvttrsZfhARRahjp5YFu6xZ9tUmxtem9-owwArYHLvU5JwxfhEG1C13tQle70NUh9Lhzsd-JiPjNl0IqORcfZRh4kw |
| CODEN | ITVGEA |
| Cites_doi | 10.1016/S1045-926X(03)00046-6 10.1016/S0925-7721(98)00028-5 10.1016/j.tcs.2016.06.006 10.1007/s00453-020-00694-7 10.1080/136588199241247 10.1080/23729333.2019.1705144 10.1016/S0924-2716(02)00167-3 10.1007/978-3-319-74180-2_17 10.1007/978-3-642-22300-6_38 10.1080/15230406.2016.1139467 10.1145/2666310.2666414 10.1145/3347146.3359087 10.1137/1.9781611973105.61 10.1145/3397536.3422242 10.1179/caj.1972.9.2.99 10.2307/2684298 10.1109/TVCG.2006.136 10.1016/0020-0190(81)90111-3 10.1109/ICDE.1997.582015 10.3390/ijgi6110342 10.1016/j.cagd.2020.101892 10.1145/3409290 10.1109/TVCG.2013.179 10.7155/jgaa.00489 10.1145/245882.245891 10.1007/978-3-319-44543-4_4 10.1023/a:1009726021843 10.1016/B978-155860915-0/50004-4 10.1007/978-3-540-70956-5_7 10.1145/142750.143054 10.1007/s11390-013-1383-8 10.1145/1097064.1097103 10.1057/palgrave.ivs.9500061 10.1016/j.cag.2020.08.005 10.1145/2851493 10.1057/palgrave.ivs.9500097 10.1080/13658816.2010.508043 10.1111/cgf.13398 10.1016/j.dam.2019.03.006 10.1080/13658810701349011 10.1145/2996913.2996957 10.1559/152304002782053314 10.1007/978-3-540-93980-1_19 10.1145/2534931.2534936 10.1016/j.comgeo.2009.03.006 |
| ContentType | Journal Article |
| DBID | 97E ESBDL RIA RIE AAYXX CITATION NPM 7X8 |
| DOI | 10.1109/TVCG.2025.3527582 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE Xplore Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef PubMed MEDLINE - Academic |
| DatabaseTitle | CrossRef PubMed MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic PubMed |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher – sequence: 3 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1941-0506 |
| EndPage | 6704 |
| ExternalDocumentID | 40030894 10_1109_TVCG_2025_3527582 10834546 |
| Genre | orig-research Journal Article |
| GrantInformation_xml | – fundername: Open Access Publication Fund of the University of Bon – fundername: Deutsche Forschungsgemeinschaft; German Research Foundation grantid: EXC-2070 - 390732324 funderid: 10.13039/501100001659 – fundername: DFG, German Research Foundation grantid: 459420781 – fundername: Hausdorff Center for Mathematics funderid: 10.13039/501100014603 |
| GroupedDBID | --- -~X .DC 0R~ 29I 4.4 53G 5GY 5VS 6IK 97E AAJGR AASAJ AAWTH ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD ESBDL F5P HZ~ H~9 IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P PQQKQ RIA RIE RNI RNS RZB TN5 VH1 AAYXX CITATION AARMG ABAZT NPM 7X8 |
| ID | FETCH-LOGICAL-c317t-d3ecb059f8a2daa7429820edd993c24f9b57aa2372f7759dcce0a813d9fdb53e3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001566958200043&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1077-2626 1941-0506 |
| IngestDate | Sat Nov 01 14:57:33 EDT 2025 Sat Sep 06 11:15:43 EDT 2025 Sat Nov 29 07:31:53 EST 2025 Mon Dec 08 03:37:12 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 10 |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0/legalcode |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c317t-d3ecb059f8a2daa7429820edd993c24f9b57aa2372f7759dcce0a813d9fdb53e3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0002-8427-3246 0000-0001-6638-7250 |
| OpenAccessLink | https://ieeexplore.ieee.org/document/10834546 |
| PMID | 40030894 |
| PQID | 3173403870 |
| PQPubID | 23479 |
| PageCount | 14 |
| ParticipantIDs | ieee_primary_10834546 proquest_miscellaneous_3173403870 pubmed_primary_40030894 crossref_primary_10_1109_TVCG_2025_3527582 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-10-01 |
| PublicationDateYYYYMMDD | 2025-10-01 |
| PublicationDate_xml | – month: 10 year: 2025 text: 2025-10-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States |
| PublicationTitle | IEEE transactions on visualization and computer graphics |
| PublicationTitleAbbrev | TVCG |
| PublicationTitleAlternate | IEEE Trans Vis Comput Graph |
| PublicationYear | 2025 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | Williams (ref13) 2013; 6 ref12 ref15 ref53 ref11 ref55 ref10 ref17 ref16 ref19 ref18 Cook (ref14) 2005 Schwartges (ref42) Chan (ref31) ref51 ref50 Bahrdt (ref2) ref46 ref45 ref48 ref47 ref41 ref44 ref43 ref49 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40 ref35 ref34 ref37 ref36 ref33 ref32 ref1 ref39 ref38 Garey (ref52) 1979 Bannister (ref28) Bokal (ref29) ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref27 Stienen (ref54) 2017 Chan (ref30) |
| References_xml | – start-page: 240 volume-title: Proc. Symp. Comput. Geometry ident: ref29 article-title: Finding all maximal subsequences with hereditary properties – year: 2017 ident: ref54 article-title: Bird tracking–GPS tracking of lesser black-backed gulls and herring gulls breeding at the southern north sea coast. version 5.6 – start-page: 84 volume-title: Proc. 16th ICA Generalisation Workshop ident: ref42 article-title: Optimizing active ranges for point selection in dynamic maps – ident: ref16 doi: 10.1016/S1045-926X(03)00046-6 – ident: ref35 doi: 10.1016/S0925-7721(98)00028-5 – ident: ref41 doi: 10.1016/j.tcs.2016.06.006 – ident: ref38 doi: 10.1007/s00453-020-00694-7 – volume: 6 start-page: 59 issue: 1 year: 2013 ident: ref13 article-title: Interactive maps: What we know and what we need to know publication-title: J. Spatial Inf. Sci. – ident: ref5 doi: 10.1080/136588199241247 – ident: ref4 doi: 10.1080/23729333.2019.1705144 – ident: ref12 doi: 10.1016/S0924-2716(02)00167-3 – ident: ref32 doi: 10.1007/978-3-319-74180-2_17 – ident: ref43 doi: 10.1007/978-3-642-22300-6_38 – ident: ref22 doi: 10.1080/15230406.2016.1139467 – ident: ref46 doi: 10.1145/2666310.2666414 – ident: ref33 doi: 10.1145/3347146.3359087 – ident: ref25 doi: 10.1137/1.9781611973105.61 – volume-title: Proc. Can. Conf. Comput. Geometry ident: ref30 article-title: Time-windowed closest pair – ident: ref34 doi: 10.1145/3397536.3422242 – ident: ref6 doi: 10.1179/caj.1972.9.2.99 – start-page: 28:1 volume-title: Proc. Symp. Comput. Geometry ident: ref31 article-title: Two approaches to building time-windowed geometric data structures – ident: ref55 doi: 10.2307/2684298 – ident: ref7 doi: 10.1109/TVCG.2006.136 – ident: ref51 doi: 10.1016/0020-0190(81)90111-3 – ident: ref8 doi: 10.1109/ICDE.1997.582015 – ident: ref36 doi: 10.3390/ijgi6110342 – ident: ref1 doi: 10.1016/j.cagd.2020.101892 – ident: ref3 doi: 10.1145/3409290 – ident: ref49 doi: 10.1109/TVCG.2013.179 – ident: ref26 doi: 10.7155/jgaa.00489 – ident: ref24 doi: 10.1145/245882.245891 – ident: ref45 doi: 10.1007/978-3-319-44543-4_4 – ident: ref48 doi: 10.1023/a:1009726021843 – ident: ref20 doi: 10.1016/B978-155860915-0/50004-4 – ident: ref9 doi: 10.1007/978-3-540-70956-5_7 – ident: ref19 doi: 10.1145/142750.143054 – ident: ref11 doi: 10.1007/s11390-013-1383-8 – ident: ref23 doi: 10.1145/1097064.1097103 – ident: ref21 doi: 10.1057/palgrave.ivs.9500061 – ident: ref39 doi: 10.1016/j.cag.2020.08.005 – ident: ref44 doi: 10.1145/2851493 – ident: ref18 doi: 10.1057/palgrave.ivs.9500097 – ident: ref10 doi: 10.1080/13658816.2010.508043 – ident: ref50 doi: 10.1111/cgf.13398 – ident: ref27 doi: 10.1016/j.dam.2019.03.006 – ident: ref15 doi: 10.1080/13658810701349011 – volume-title: Proc. 26th Can. Conf. Comput. Geometry ident: ref28 article-title: Windows into geometric events: Data structures for time-windowed querying of temporal point sets – ident: ref37 doi: 10.1145/2996913.2996957 – ident: ref17 doi: 10.1559/152304002782053314 – ident: ref53 doi: 10.1007/978-3-540-93980-1_19 – ident: ref47 doi: 10.1145/2534931.2534936 – ident: ref40 doi: 10.1016/j.comgeo.2009.03.006 – volume-title: Illuminating the Path: The Research and Development Agenda for Visual Analytics year: 2005 ident: ref14 – start-page: 247 volume-title: Proc. 19th Workshop Algorithm Eng. Experiments ident: ref2 article-title: Growing balls in $\mathbb {R}^{d}$Rd – volume-title: Computers and Intractability: A Guide to the Theory of NP-Completeness year: 1979 ident: ref52 |
| SSID | ssj0014489 |
| Score | 2.4604366 |
| Snippet | User interfaces for inspecting spatio-temporal events often allow their users to filter the events by specifying a time window with a time slider. We consider... |
| SourceID | proquest pubmed crossref ieee |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 6691 |
| SubjectTerms | Annotations approximation algorithm Approximation algorithms Data structures Data visualization dynamic query interface Earthquakes Heuristic algorithms Labeling Map labeling Reproducibility of results Spatial databases temporal consistency time-window query Tornadoes |
| Title | Algorithms for Consistent Dynamic Labeling of Maps With a Time-Slider Interface |
| URI | https://ieeexplore.ieee.org/document/10834546 https://www.ncbi.nlm.nih.gov/pubmed/40030894 https://www.proquest.com/docview/3173403870 |
| Volume | 31 |
| WOSCitedRecordID | wos001566958200043&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1941-0506 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014489 issn: 1077-2626 databaseCode: RIE dateStart: 19950101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED5RxAADzwLhURmJCSkljZM6HhFQGKAgUaBb5PgBSJCgJuX3c3ZSBEMHtgxOnNx3sb_z-fwBHCdRpkItqR_axCEOeJnPA6X8XsIyQY1GPhc5sQk2HCbjMb9vitVdLYzW2m0-01176XL5qpBTu1SGf3hCozjqt6DFWL8u1vpJGWCcwesNhswPkaY3KcxewE9HT-dXGAqGcRfpBhJkK2ETuZNaePRnPnICK_O5pptzBmv_fNt1WG3IJTmrvWEDFnS-CSu_jhzcgruz95di8la9fpQE-Spxgp2IdF6Ri1qcntyIzBWpk8KQW_FZkmdsTgSx1SL-w7ut2yNuIdEIqdvwOLgcnV_7jaiCL5EqVL6iWmbIqUwiQiUERsYcSYBWComKDCPDs5gJEVIWGsZirqTUgUh6VHGjsphqug2LeZHrXSCK9oVyKjdxgJAbm8QPAiMZmsLwSHtwMjNt-lmfnZG6mCPgqYUktZCkDSQetK0JfzWsrefB0QyNFD3fpjNErotpmeLnYH8UBxwPdmqYfu6eobs356n7sGw7r3flHcBiNZnqQ1iSX9VbOemge42TjnOvb4t3yXA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwEB1BQQIO7EtZjcQJKZDaDomPiF2UgkRZbpHjBZAgqdqU72fspAgOHLjl4CTOPMd-45nxA9hLeKapUSygLnCIE14WiFDroJXEmWTWIJ_jXmwi7nSS52dxVxer-1oYY4xPPjMH7tLH8nWhhm6rDP_whPGIH43DRMQ5Datyre-gAXoaokoxjAOKRL0OYrZCcdh9PLlAZ5BGB0g4kCI7ERvuz2oR_NeK5CVW_mabftU5n_tnf-dhtqaX5LgaDwswZvJFmPlx6OAS3B6_vxT9t_L1Y0CQsRIv2YlY5yU5reTpSVtmvkydFJbcyN6APGFzIomrFwnu313lHvFbiVYqswwP52fdk8ugllUIFJKFMtDMqAxZlU0k1VKibyyQBhitkaooyq3IolhKymJq4zgSWikTyqTFtLA6i5hhK9DIi9ysAdHsSGqvcxOFCLp1YfwwtCpGU1jBTRP2R6ZNe9XpGan3OkKROkhSB0laQ9KEZWfCHw0r6zVhd4RGimPfBTRkborhIMXPwfcxnHKasFrB9H33CN31P566A1OX3Zt22r7qXG_AtOtIlaO3CY2yPzRbMKk-y7dBf9sPsi9x-cvP |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Algorithms+for+Consistent+Dynamic+Labeling+of+Maps+With+a+Time-Slider+Interface&rft.jtitle=IEEE+transactions+on+visualization+and+computer+graphics&rft.au=Bonerath%2C+Annika&rft.au=Driemel%2C+Anne&rft.au=Haunert%2C+Jan-Henrik&rft.au=Haverkort%2C+Herman&rft.date=2025-10-01&rft.eissn=1941-0506&rft.volume=31&rft.issue=10&rft.spage=6691&rft_id=info:doi/10.1109%2FTVCG.2025.3527582&rft_id=info%3Apmid%2F40030894&rft.externalDocID=40030894 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1077-2626&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1077-2626&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1077-2626&client=summon |