On the Edge Label Placement problem

Kakoulis, Konstantinos G.; Tollis, Ioannis G.

doi:10.1007/3-540-62495-3_52

Cited by 30 publications

(37 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…for bended edges it is NP-hard [23]. In map labeling labels are rather short-city, street or river names-but in arbitrary Domain Specific Languages (DSLs) they do not need to be, as Fig.…”

Section: Label Managementmentioning

confidence: 99%

On the Pragmatics of Model-Based Design

Fuhrmann

Hanxleden

2010

Foundations of Computer Software. Future Trends and Techniques for Development

View full text Add to dashboard Cite

Abstract. The pragmatics of model-based design refers to the practical aspects of handling graphical system models. This encompasses a range of activities, such as editing, browsing or simulating models. We believe that the pragmatics of modeling deserves more attention than is has received so far. We also believe that there is the potential for significant productivity enhancements, using technology that is largely already available. A key enabler here is the capability to automatically and quickly compute the layout of a graphical model, which frees the designer from the burden of manual drawing. This capability also allows to compute customized view of a model on the fly, which offers new possibilities for interactive browsing and for simulation.

show abstract

“…for bended edges it is NP-hard [23]. In map labeling labels are rather short-city, street or river names-but in arbitrary Domain Specific Languages (DSLs) they do not need to be, as Fig.…”

Section: Label Managementmentioning

confidence: 99%

On the Pragmatics of Model-Based Design

Fuhrmann

Hanxleden

2010

Foundations of Computer Software. Future Trends and Techniques for Development

View full text Add to dashboard Cite

show abstract

“…The map labeling problem has also attracted the interest of several researchers. Even if the majority of map labeling problems are shown to be N P -complete [7,9,10,13], several approaches have been suggested, among them expert systems [2], approximation algorithms [1,7,13,15], zero-one integer programming [17], simulated annealing [18]. An extensive bibliography on map labeling is maintained by Strijk and Wolff [16].…”

Section: Introductionmentioning

confidence: 99%

Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem

et al. 2009

View full text Add to dashboard Cite

Abstract. The metro-line crossing minimization (MLCM) problem was recently introduced in [5] as a response to the problem of drawing metro maps or public transportation networks, in general. According to this problem, we are given a planar, embedded graph G = (V, E) and a set L of simple paths on G, called lines. The main task is to place the lines on the embedding of G, so that the number of crossings among pairs of lines is minimized. Our main contribution is two polynomial time algorithms. The first solves the general case of the MLCM problem, where the lines that traverse a particular vertex of G are allowed to use any side of it to either "enter" or "exit", assuming that the endpoints of the lines are located at vertices of degree one. The second one -which is more efficient in terms of time complexity-solves the restricted case, where only the left and the right side of each vertex can be used. To the best of our knowledge, this is the first time where the general case of the MLCM problem is solved. Previous work in the graph drawing literature was devoted to the restricted case of the MLCM problem under the additional assumption that the endpoints of the lines are either the topmost or the bottommost in their corresponding vertices, i.e., they are either on top or below the lines that pass through the vertex. Even for this case, we improve a known result of Asquith et al. [3] from O(|E| 5/2 |L| 3 ) to O(|V |(|E| + |L|)).

show abstract

“…The general problem of Map Labeling can be sub-divided into various categories, depending on the type of feature being labeled, whether points [5,36], lines [22,45], or polygonal areas [11,23]. This paper will address the point label problem for dense point-clouds (cf.…”

Section: Introductionmentioning

confidence: 99%

Fast Point-Feature Label Placement for Dynamic Visualizations

Mote

2007

Information Visualization

View full text Add to dashboard Cite

This paper describes a fast approach to automatic point label de-confliction on interactive maps. The general Map Labeling problem is NP-hard and has been the subject of much study for decades. Computerized maps have introduced interactive zooming and panning which has intensified the problem. Providing dynamic labels for such maps typically requires a timeconsuming pre-processing phase. In the realm of visual analytics, however, the labeling of interactive maps is further complicated by the use of massive datasets laid out in arbitrary configurations, thus rendering reliance on a pre-processing phase untenable. This paper offers a method for labeling point-features on dynamic maps in real time without pre-processing. The algorithm presented is efficient, scalable, and exceptionally fast; it can label interactive charts and diagrams at speeds of multiple frames per second on maps with tens of thousands of nodes.To accomplish this, the algorithm employs a novel geometric de-confliction approach, the "trellis strategy," along with a unique label candidate cost analysis to determine the "least expensive" label configuration. The speed and scalability of this approach make it well-suited for visual analytic applications.iv

show abstract

On the Edge Label Placement problem

Cited by 30 publications

References 11 publications

On the Pragmatics of Model-Based Design

On the Pragmatics of Model-Based Design

Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem

Fast Point-Feature Label Placement for Dynamic Visualizations

Contact Info

Product

Resources

About