Konstantinos G. Kakoulis, Ioannis G. Tollis  Home/Search
Context Related
| duke.edu/CGC/workshop9...tollisfull.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: duke.edu/CGC/workshop9...schedule (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Let G(V;E) be a graph, and let \Gamma be the drawing of G on the plane. We consider the problem of assigning text labels to every edge of G such that the quality of the labeling assignment is optimal. This problem has been first encountered in automated cartography. Even though much effort has been devoted over the last 15 years in the area of automated drawing of maps, the Edge Label Placement (ELP) problem remains essentially unsolved. In this paper we investigate the ELP problem. We... (Update)
Context of citations to this paper: More
...labeling problems. So far, problems from this class have only been attacked by applying map labeling algorithms to graph drawings [KT97,IL97]. Figure 1 shows a labeled drawing for a state diagram; rst the underlying graph has been drawn, in a last step the labels have been...
...for the corresponding ILP yields a bend minimum drawing with respect to the embedding and constraints. Labeling of edges. See [16] for references on this important subject. We restrict the labels to be placed only at horizontal segments and to have a prescribed, not...
Cited by: More
A Framework for the Static and Interactive Visualization.. - Castelló, Mili, Tollis (2002) (Correct)
Polynomial Time Algorithms for Three-label Point Labeling - Duncan, Qian, Vigneron, Zhu (2001) (Correct)
Edge Labeling in the Graph Layout Toolkit - Dogrusoz, Kakoulis, Madden, Tollis (1998) (Correct)
Similar documents (at the sentence level):
5.2%: On the Edge Label Placement Problem - Kakoulis, Tollis (1997) (Correct)
Active bibliography (related documents): More All
2.1: An Algorithm for Labeling Edges of Hierarchical Drawings - Kakoulis, Tollis (1997) (Correct)
0.6: On the Multiple Label Placement Problem - Kakoulis, Tollis (1998) (Correct)
0.5: Map Labeling and Its Generalizations - Doddi, Marathe, Mirzaian, Moret.. (1997) (Correct)
Similar documents based on text: More All
0.5: A Unified Approach to Labeling Graphical Features - Konstantinos Kakoulis (1998) (Correct)
0.3: Refinement of Orthogonal Graph Drawings - Six, Kakoulis, Tollis (1998) (Correct)
0.2: Techniques for the Refinement of Orthogonal Graph Drawings - Six, Kakoulis, Tollis (2000) (Correct)
Related documents from co-citation: More All
5: A packing problem with applications to lettering of maps (context) - Formann, Wagner - 1991
5: An empirical study of algorithms for point-feature label placement - Christensen, Marks et al. - 1995
3: Map Labeling Heuristics: Provably good and practically useful - Wagner, Wolff - 1995
BibTeX entry: (Update)
K. G. Kakoulis and I. G. Tollis. An algorithm for labeling edges of hierarchical drawings. In Proceedings of the Symposium on Graph Drawing '97, volume 1353 of Lecture Notes in Computer Science, pages 169--180, 1997. http://citeseer.ist.psu.edu/article/kakoulis97algorithm.html More
@inproceedings{ kakoulis97algorithm,
author = "Konstantinos G. Kakoulis and Ioannis G. Tollis",
title = "An Algorithm for Labeling Edges of Hierarchical Drawings",
booktitle = "Proceedings of the Symposium on Graph Drawing '97",
volume = "1353",
pages = "169--180",
year = "1997",
url = "citeseer.ist.psu.edu/article/kakoulis97algorithm.html" }
Citations (may not include all citations):198 Algorithms for drawing graphs: an annotated bibliography (context) - Di Battista, Eades et al. - 1994
61 An empirical study of algorithms for point feature label pla.. - Christensen, Marks et al. - 1995
60 Matching Theory (context) - Lovasz, Plummer - 1986
57 A packing problem with applications to lettering of maps (context) - Formann, Wagner - 1991
43 Positioning names on maps (context) - Imhof - 1975
33 An algorithm for automatic name placement around point data (context) - Hirsch - 1982
32 Two theorems in graph theory (context) - Berge - 1957
27 The computational complexity of cartographic label placement - Marks, Shieber - 1991
25 The logic of automated map lettering (context) - Yoeli - 1972
22 The solution of large 0-1 integer programming problems encou.. (context) - Zoraster - 1990
18 Map labeling heuristics: Provably good and practically usefu.. - Wagner, Wolff - 1995
18 An experimental comparison of four graph drawing algorithms (context) - Di Battista, Garg et al. - 1996
13 Society for Industrial Applied Mathematics (context) - Tarjan, Network et al. - 1983
9 A program for automatic name placement (context) - Ahn, Freeman - 1984
5 the Edge Label Placement Problem - Kakoulis, Tollis - 1997
5 Application challenges to computational geometry (context) - Geometry, Force - 1996
4 Graph Drawing and Information Visualization (context) - Tollis - 1996
4 The NP-completeness of the character placement problem of 2 .. (context) - Kato, Imai - 1988
4 decennial census (context) - Ebinger, Goulete et al. - 1990
2 Personal communication (context) - Marks - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.duke.edu/CGC/workshop97/schedule.html): More
Minimum Weight Convex Quadrangulation of a Constrained.. - Fevens, Meijer, Rappaport (1997) (Correct)
Fault-Tolerant Spanners - Levcopoulos, Narasimhan, Smid (Correct)
The Three-Phase Method and Applications - Biedl (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC