@article {IOPORT.02104276,
    author       = {Koike, Atsushi and Nakano, Shin-Ichi and Nishizeki, Takao and Tokuyama, Takeshi and Watanabe, Shuhei},
    title        = {Labeling points with rectangles of various shapes.},
    year         = {2002},
    journal      = {International Journal of Computational Geometry \& Applications},
    volume       = {12},
    number       = {6},
    issn         = {0218-1959},
    pages        = {511-528},
    publisher    = {World Scientific, Singapore},
    doi          = {10.1142/S0218195902001018},
    abstract     = {Summary: We deal with a map-labeling problem, named LOFL (Left-part Ordered Flexible Labeling), to label a set of points in a plane in the presence of polygonal obstacles. The label for each point is selected from a set of rectangles with various shapes satisfying the left-part ordered property, and is placed near to the point after scaled by a scaling factor $s$ which is common to all points. In this paper, we give an optimal $O((n + m) \log(n+m))$ algorithm to decide the feasibility of LOFL for a fixed scaling factor s, and an $O((n + m) \log^2(n + m))$ time algorithm to find the largest feasible scaling factor $s$, where $n$ is the number of points and $m$ is the total number of edges of the polygonal obstacles.},
    identifier   = {02104276},
}