Results 11  20
of
36
Dynamic label placement for improved interactive exploration
 In International Symposium on NonPhotorealistic Animation and Rendering (NPAR
, 2008
"... Figure 1: An example of dynamic labeling for a complex scene. See accompanying video for better demonstration. This work presents a novel approach for dynamically rendering annotations attached to a 3D scene. We formulate the problem as a general optimization under constraints, accounting for certai ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Figure 1: An example of dynamic labeling for a complex scene. See accompanying video for better demonstration. This work presents a novel approach for dynamically rendering annotations attached to a 3D scene. We formulate the problem as a general optimization under constraints, accounting for certain desirable properties. To approximately solve the NPhard optimization problem in realtime, we present a particular heuristic that greedily places labels while maintaining constraints. Typical greedy label placement algorithms do not pay particular attention to the order of placement and, as a result, suffer from the fundamental limitation that successive labels get progressively more difficult to place. We use algorithmic and mathematical tools that compensate for the drawback of typical greedy approaches. In addition, they are well suited for GPU implementation, because they are completely image based. As a result, we can place tens of labels in realtime, as demonstrated in this paper.
Route Visualization using Detail Lenses
, 2008
"... We present a method designed to address some limitations of typical route map displays of driving directions. The main goal of our system is to generate a printable version of a route map that shows the overview and detail views of the route within a single, consistent visual frame. Our proposed vis ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
We present a method designed to address some limitations of typical route map displays of driving directions. The main goal of our system is to generate a printable version of a route map that shows the overview and detail views of the route within a single, consistent visual frame. Our proposed visualization provides a more intuitive spatial context than a simple list of turns. We present a novel multifocus technique to achieve this goal, where the foci are defined by pointsofinterest (POI) along the route. A detail lens that encapsulates the POI at a finer geospatial scale is created for each focus. The lenses are laid out on the map to avoid occlusion with the route and each other, and to optimally utilize the free space around the route. We define a set of layout metrics to evaluate the quality of a lens layout for a given route map visualization. We compare standard lens layout methods to our proposed method and demonstrate the effectiveness of our method in generating aesthetically pleasing layouts. Finally, we perform a user study to evaluate the effectiveness of our layout choices.
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.
Form Follows Function: Aesthetic Interactive Labels
, 2005
"... Labels effectively convey coreferential relations between textual and visual elements and are a powerful tool to support learning tasks. Therefore, almost all illustrations in scientific or technical documents employ a large number of labels. This paper introduces a novel approach to integrate inte ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Labels effectively convey coreferential relations between textual and visual elements and are a powerful tool to support learning tasks. Therefore, almost all illustrations in scientific or technical documents employ a large number of labels. This paper introduces a novel approach to integrate internal and external labels into projections of complex 3D models in the fashion of handmade illustrations. The realtime label layout algorithms proposed in the paper balance a number of conflicting requirements such as unambiguity, readability, aesthetic considerations and framecoherency.
Algorithms for MultiCriteria Boundary Labeling
, 2009
"... We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to one side of the bounding box of P. The points are connected to their labels by curves (leaders) that consist of two segments: a horizontal segment, and a second segment at a fixed angle with the f ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to one side of the bounding box of P. The points are connected to their labels by curves (leaders) that consist of two segments: a horizontal segment, and a second segment at a fixed angle with the first. Our algorithms find a collection of crossingfree leaders that minimizes the total number of bends, the total length, or any other ‘badness ’ function of the leaders. A generalization to labels on two opposite sides of the bounding box of P is considered and an experimental evaluation of the performance is included. Submitted:
SYMVONIS A.: Combining traditional map labeling with boundary labeling
 In Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM2011) (2011
"... Abstract. The traditional map labeling problems are mostly N Phard. Hence, effective heuristics and approximations have been developed in the past. Recently, efficient algorithms for the socalled boundary labeling model have been introduced which assumes that the labels are placed on the boundary ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract. The traditional map labeling problems are mostly N Phard. Hence, effective heuristics and approximations have been developed in the past. Recently, efficient algorithms for the socalled boundary labeling model have been introduced which assumes that the labels are placed on the boundary of the map and connected by polygonal leaders to their corresponding sites. Internal labels have been forbidden. In this paper, we allow both. Since clearly internal labels should be preferred, we consider several maximization problems for the number of internal labels and we show that they can be obtained efficiently or in quasipolynomial time.
Matching points with rectangles and squares
, 2009
"... In this paper we deal with the following natural family of geometric matching problems. Given a class C of geometric objects and a set P of points in the plane, a Cmatching is a set M ⊆ C such that every C ∈ M contains exactly two elements of P. The matching is perfect if it covers every point, and ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper we deal with the following natural family of geometric matching problems. Given a class C of geometric objects and a set P of points in the plane, a Cmatching is a set M ⊆ C such that every C ∈ M contains exactly two elements of P. The matching is perfect if it covers every point, and strong if the objects do not intersect. We concentrate on matching points using axesaligned squares and rectangles. We propose an algorithm for strong rectangle matching that, given a set of n points, matches at least 2⌊n/3 ⌋ of them, which is worstcase optimal. If we are given a combinatorial matching of the points, we can test efficiently whether it has a realization as a (strong) square matching. The algorithm behind this test can be modified to solve an interesting new pointlabeling problem. On the other hand we show that it is NPhard to decide whether a point set has a perfect strong square matching.
Bler: A boundary labeller for technical drawings
 In Proc. 13th Int. Symposium on Graph Drawing (GD’05), LNCS 3843
, 2005
"... Abstract. BLer is a prototype tool aiming to automate the boundary labelling process [1]. It targets the area of technical and medical drawings, where it is often common to explain certain features of the drawing by blocks of text that are arranged on its boundary. 1 ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Abstract. BLer is a prototype tool aiming to automate the boundary labelling process [1]. It targets the area of technical and medical drawings, where it is often common to explain certain features of the drawing by blocks of text that are arranged on its boundary. 1
AreaFeature Boundary Labeling
, 2009
"... Boundary labeling is a relatively new labeling method. It can be useful in automating the production of technical drawings and medical drawings, where it is common to explain certain parts of the drawing with text labels, arranged on its boundary so that other parts of the drawing are not obscured. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Boundary labeling is a relatively new labeling method. It can be useful in automating the production of technical drawings and medical drawings, where it is common to explain certain parts of the drawing with text labels, arranged on its boundary so that other parts of the drawing are not obscured. In boundary labeling, we are given a rectangle R which encloses a set of n sites. Each site s is associated with an axisparallel rectangular label ls. The labels must be placed in distinct positions on the boundary of R and they must be connected to their corresponding sites with polygonal lines, called leaders, so that the labels are pairwise disjoint and the leaders do not intersect each other. In this paper, we study a version of the boundary labeling problem where the sites can ‘float ’ within a polygonal region. We present a polynomial time algorithm, which runs in O(n 3) time and produces a labeling of minimum total leader length for labels of uniform size placed in fixed positions on the boundary of rectangle R.