Results 1 
8 of
8
personal communication
, 1997
"... these abstracts from the Eighteenth Annual Scientific Meeting may not present completed work nor were they formally peerreviewed for technical content. Individuals wishing to reference or quote from these abstracts in whole or part should obtain the author's permission. Abstracts were opticall ..."
Abstract

Cited by 52 (2 self)
 Add to MetaCart
(Show Context)
these abstracts from the Eighteenth Annual Scientific Meeting may not present completed work nor were they formally peerreviewed for technical content. Individuals wishing to reference or quote from these abstracts in whole or part should obtain the author's permission. Abstracts were optically scanned and then edited for entry into this compilation. But since the process is not perfect, errors may have been introduced, for which we apologize.
Manytoone boundary labeling
 In Proc. Asia Pacific Symposium on Information Visualisation (APVIS2007), IEEE
, 2007
"... In boundary labeling, each point site is uniquely connected to a label placed on the boundary of an enclosing rectangle by a leader, which may be a rectilinear or straight line segment. To our knowledge, all the results reported in the literature for boundary labeling deal with the socalled oneto ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
(Show Context)
In boundary labeling, each point site is uniquely connected to a label placed on the boundary of an enclosing rectangle by a leader, which may be a rectilinear or straight line segment. To our knowledge, all the results reported in the literature for boundary labeling deal with the socalled onetoone boundary labeling, i.e., different sites are labelled differently. In certain applications of boundary labeling, however, more than one site may be required to be connected to a common label. In this case, the presence of crossings among leaders often becomes inevitable. Minimizing the total number of crossings in boundary labeling becomes a critical design issue as crossing is often regarded as the main source of confusion in visualization. In this paper, we consider the crossing minimization problem for multisitetoonelabel boundary labeling, i.e., finding the placements of labels and leaders such that the total number of crossings among leaders is minimized. We show the crossing minimization problem to be NPcomplete under certain oneside and twoside labeling schemes. Subsequently, approximation algorithms or heuristics are derived for the above intractable problems.
Polygon Labelling of Minimum Leader Length
"... We study a variation of the boundary labelling problem, with floating sites (represented as polygons), labels of uniform size placed in fixed positions on the boundary of a rectangle (that encloses all sites) and special type of leaders connecting labels to sites. We seek to obtain a labelling of al ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We study a variation of the boundary labelling problem, with floating sites (represented as polygons), labels of uniform size placed in fixed positions on the boundary of a rectangle (that encloses all sites) and special type of leaders connecting labels to sites. We seek to obtain a labelling of all sites with leaders that are nonoverlapping and have minimum total length. We present an O(n n) time algorithm for the labelling of polygons.
Polygons Labelling of Minimum Leader Length
"... We study a variation of the boundary labelling model, with floating sites, labels of uniform size placed in fixed positions on the boundary (that encloses all sites) and special type leaders connecting labels to sites. We seek to obtain a labelling of all sites with leaders that are nonoverlapping ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
We study a variation of the boundary labelling model, with floating sites, labels of uniform size placed in fixed positions on the boundary (that encloses all sites) and special type leaders connecting labels to sites. We seek to obtain a labelling of all sites with leaders that are nonoverlapping and have minimum total length. We present an O(n2 log3 n) time algorithm for the labelling of polygons.
On MultiStack Boundary Labeling Problems
"... Boundary labeling is a relatively new labeling method. It targets the areas of technical drawings and medical maps, where it is often common to explain certain parts of the drawing with large text labels arranged on its boundary, so that other parts of the drawing are not obscured. According to thi ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
Boundary labeling is a relatively new labeling method. It targets the areas of technical drawings and medical maps, where it is often common to explain certain parts of the drawing with large text labels arranged on its boundary, so that other parts of the drawing are not obscured. According to this labeling method, we are given a rectangle R, which encloses a set of n sites. Each site si is associated with an axisparallel rectangular label li. The labels must be placed in distinct positions on the boundary of R and to be connected to their corresponding sites with polygonal lines, called leaders, so that a) labels are pairwise disjoint and b) leaders do not intersect each other. In this paper, we examine labelings with more than one stacks of uniform labels on each side of R and we aim to maximize the (uniform) label size.
Labeling collinear sites
 In 6th Asia Pacific Symposium on Visualization 2007 (APVIS ’07
, 2007
"... We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site si is associated with an axisparallel wi hi label li, which can be placed anywhere on the boundary of the input line L ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site si is associated with an axisparallel wi hi label li, which can be placed anywhere on the boundary of the input line L. The main task is to place the labels in distinct positions, so that they do not overlap and do not obscure the site set, and to connect each label with its associated site through a leader, such that no two leaders intersect. We propose several variations of this problem and we investigate their computational complexity under certain optimization criteria.
Efficient Labeling of Collinear Sites
, 2008
"... In this paper we study the map labeling problem where the sites to be labeled are restricted to a line L. Previous models studied in the map labeling literature fail to produce label placements (i.e. place each label next to the site it describes) without label overlaps for certain instances of the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
In this paper we study the map labeling problem where the sites to be labeled are restricted to a line L. Previous models studied in the map labeling literature fail to produce label placements (i.e. place each label next to the site it describes) without label overlaps for certain instances of the problem with dense point sets. To address this problem, we propose a new approach according to which, given n sites each associated with an axisparallel rectangular label, we aim to place the labels in distinct positions on the “boundary” of L so that they do not overlap and do not obscure the site set, and to connect each label with its associated site through a leader such that no two leaders intersect. We evaluate our labeling model under two minimization criteria: (i) total leader length and (ii) total number of leader bends. We show that both problems are NPcomplete if the labels can be placed on both sides of L, while we present polynomial time algorithms for the case where the labels can be placed on only one side of L.
MinimumChange Drawings for Labeled Graphs
, 2007
"... The interest in algorithms that automate the process of information visualization by the usage of textual labels for features of interest within a visualization has increased with the advance in typesetting technology and the amount of information to be visualized. In this paper, we study minimumc ..."
Abstract
 Add to MetaCart
(Show Context)
The interest in algorithms that automate the process of information visualization by the usage of textual labels for features of interest within a visualization has increased with the advance in typesetting technology and the amount of information to be visualized. In this paper, we study minimumchange drawings for labeled graphs, adopting the boundary labeling model [6]. Changes within the graph may occur because of the actions of a user, which is able to insert new features within the visualization, delete previously placed features and change the sizes of the labels. Each time the user acts, a small change should be performed within the visualization in order to rearrange its components with respect to some optimization criterion. We model this problem and we also provide several heuristics to obtain “nearoptimal” solutions.