Label Size Maximization for Rectangular Node Labels
Summary :
The label placement problem is one of the most important problems in geographic information systems, cartography, graph drawing, and graphical interface design. In this paper, we considered the label size maximization problem for points with axes-parallel rectangular labels that correspond to character strings and have different widths based on the number of characters. We propose an algorithm for computing the optimum size for the label size maximization problem in the 2-position model and a polynomial time algorithm for the problem in the 4-position model. Our algorithm cannot obtain the maximum value in the 4-position model because the label size maximization problem in the 4-position model is NP-hard. However, our algorithm is efficient in practice, as shown by computational experiments. Further, computational results for JR trains, subways and major private railroads in Tokyo are presented.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.4 pp.1035-1041
- Publication Date
- 2006/04/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e89-a.4.1035
- Type of Manuscript
- Special Section PAPER (Special Section on Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shigeki TORIUMI, Hisao ENDO, Keiko IMAI, "Label Size Maximization for Rectangular Node Labels" in IEICE TRANSACTIONS on Fundamentals,
vol. E89-A, no. 4, pp. 1035-1041, April 2006, doi: 10.1093/ietfec/e89-a.4.1035.
Abstract: The label placement problem is one of the most important problems in geographic information systems, cartography, graph drawing, and graphical interface design. In this paper, we considered the label size maximization problem for points with axes-parallel rectangular labels that correspond to character strings and have different widths based on the number of characters. We propose an algorithm for computing the optimum size for the label size maximization problem in the 2-position model and a polynomial time algorithm for the problem in the 4-position model. Our algorithm cannot obtain the maximum value in the 4-position model because the label size maximization problem in the 4-position model is NP-hard. However, our algorithm is efficient in practice, as shown by computational experiments. Further, computational results for JR trains, subways and major private railroads in Tokyo are presented.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.4.1035/_p
Copy
@ARTICLE{e89-a_4_1035,
author={Shigeki TORIUMI, Hisao ENDO, Keiko IMAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Label Size Maximization for Rectangular Node Labels},
year={2006},
volume={E89-A},
number={4},
pages={1035-1041},
abstract={The label placement problem is one of the most important problems in geographic information systems, cartography, graph drawing, and graphical interface design. In this paper, we considered the label size maximization problem for points with axes-parallel rectangular labels that correspond to character strings and have different widths based on the number of characters. We propose an algorithm for computing the optimum size for the label size maximization problem in the 2-position model and a polynomial time algorithm for the problem in the 4-position model. Our algorithm cannot obtain the maximum value in the 4-position model because the label size maximization problem in the 4-position model is NP-hard. However, our algorithm is efficient in practice, as shown by computational experiments. Further, computational results for JR trains, subways and major private railroads in Tokyo are presented.},
keywords={},
doi={10.1093/ietfec/e89-a.4.1035},
ISSN={1745-1337},
month={April},}
Copy
TY - JOUR
TI - Label Size Maximization for Rectangular Node Labels
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1035
EP - 1041
AU - Shigeki TORIUMI
AU - Hisao ENDO
AU - Keiko IMAI
PY - 2006
DO - 10.1093/ietfec/e89-a.4.1035
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2006
AB - The label placement problem is one of the most important problems in geographic information systems, cartography, graph drawing, and graphical interface design. In this paper, we considered the label size maximization problem for points with axes-parallel rectangular labels that correspond to character strings and have different widths based on the number of characters. We propose an algorithm for computing the optimum size for the label size maximization problem in the 2-position model and a polynomial time algorithm for the problem in the 4-position model. Our algorithm cannot obtain the maximum value in the 4-position model because the label size maximization problem in the 4-position model is NP-hard. However, our algorithm is efficient in practice, as shown by computational experiments. Further, computational results for JR trains, subways and major private railroads in Tokyo are presented.
ER -
English
