|
|
|
|
| LEADER |
01000caa a22002652c 4500 |
| 001 |
NLM252629108 |
| 003 |
DE-627 |
| 005 |
20250219031340.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2012 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TVCG.2012.193
|2 doi
|
| 028 |
5 |
2 |
|a pubmed25n0842.xml
|
| 035 |
|
|
|a (DE-627)NLM252629108
|
| 035 |
|
|
|a (NLM)26357167
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Fink, M
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Algorithms for Labeling Focus Regions
|
| 264 |
|
1 |
|c 2012
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 01.12.2015
|
| 500 |
|
|
|a Date Revised 11.09.2015
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a In this paper, we investigate the problem of labeling point sites in focus regions of maps or diagrams. This problem occurs, for example, when the user of a mapping service wants to see the names of restaurants or other POIs in a crowded downtown area but keep the overview over a larger area. Our approach is to place the labels at the boundary of the focus region and connect each site with its label by a linear connection, which is called a leader. In this way, we move labels from the focus region to the less valuable context region surrounding it. In order to make the leader layout well readable, we present algorithms that rule out crossings between leaders and optimize other characteristics such as total leader length and distance between labels. This yields a new variant of the boundary labeling problem, which has been studied in the literature. Other than in traditional boundary labeling, where leaders are usually schematized polylines, we focus on leaders that are either straight-line segments or Bezier curves. Further, we present algorithms that, given the sites, find a position of the focus region that optimizes the above characteristics. We also consider a variant of the problem where we have more sites than space for labels. In this situation, we assume that the sites are prioritized by the user. Alternatively, we take a new facility-location perspective which yields a clustering of the sites. We label one representative of each cluster. If the user wishes, we apply our approach to the sites within a cluster, giving details on demand
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Haunert, Jan-Henrik
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Schulz, A
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Spoerhase, J
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Wolff, A
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 18(2012), 12 vom: 10. Dez., Seite 2583-92
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnas
|
| 773 |
1 |
8 |
|g volume:18
|g year:2012
|g number:12
|g day:10
|g month:12
|g pages:2583-92
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TVCG.2012.193
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 18
|j 2012
|e 12
|b 10
|c 12
|h 2583-92
|