Modifying Orthogonal Drawings for Label Placement
AbstractIn 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
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Kakoulis, K.G.; Tollis, I.G. Modifying Orthogonal Drawings for Label Placement. Algorithms 2016, 9, 22.
Kakoulis KG, Tollis IG. Modifying Orthogonal Drawings for Label Placement. Algorithms. 2016; 9(2):22.Chicago/Turabian Style
Kakoulis, Konstantinos G.; Tollis, Ioannis G. 2016. "Modifying Orthogonal Drawings for Label Placement." Algorithms 9, no. 2: 22.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.