Next Article in Journal
An Improved Fireworks Algorithm Based on Grouping Strategy of the Shuffled Frog Leaping Algorithm to Solve Function Optimization Problems
Next Article in Special Issue
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
Previous Article in Journal
Multivariate Algorithmics for Finding Cohesive Subnetworks
Previous Article in Special Issue
Generating Realistic Labelled, Weighted Random Graphs
Open AccessArticle

Modifying Orthogonal Drawings for Label Placement

Department of Mechanical and Industrial Design Engineering, T.E.I. of West Macedonia, Kozani 50100, Greece
Department of Computer Science, University of Crete, Heraklion 70013, Greece
Author to whom correspondence should be addressed.
Academic Editor: Maurizio Patrignani
Algorithms 2016, 9(2), 22;
Received: 20 December 2015 / Revised: 10 March 2016 / Accepted: 16 March 2016 / Published: 28 March 2016
(This article belongs to the Special Issue Graph Drawing and Experimental Algorithms)
In this paper, we investigate how one can modify an orthogonal graph drawing to accommodate the placement of overlap-free labels with the minimum cost (i.e., minimum increase of the area and preservation of the quality of the drawing). We investigate computational complexity issues of variations of that problem, and we present polynomial time algorithms that find the minimum increase of space in one direction, needed to resolve overlaps, while preserving the orthogonal representation of the orthogonal drawing when objects have a predefined partial order. View Full-Text
Keywords: automated label placement; edge labeling; graph labeling; orthogonal drawings; graph drawing; NP-hard automated label placement; edge labeling; graph labeling; orthogonal drawings; graph drawing; NP-hard
Show Figures

Figure 1

MDPI and ACS Style

Kakoulis, K.G.; Tollis, I.G. Modifying Orthogonal Drawings for Label Placement. Algorithms 2016, 9, 22.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map

Back to TopTop