Labeling points with rectangles of various shapes

Shin Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)


We deal with a map-labeling problem, named LOFL (Left- part Ordered Flexible Labeling), to label a set of points in a plane with 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 σ, and an O((n + m) log2(n + m)) time algorithm to find the largest feasible scaling factor s, where n is the number of points and m is the number of edges of polygonal obstacles.

Original languageEnglish
Title of host publicationGraph Drawing - 8th International Symposium, GD 2000 ColonialWilliamsburg, VA, USA, September 20-23, 2000 Proceedings
EditorsJoe Marks
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540415548, 9783540415541
Publication statusPublished - 2001
Event8th International Symposium on Graph Drawing, GD 2000 - Colonial Williamsburg, United States
Duration: 2000 Sep 202000 Sep 23

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other8th International Symposium on Graph Drawing, GD 2000
Country/TerritoryUnited States
CityColonial Williamsburg

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Labeling points with rectangles of various shapes'. Together they form a unique fingerprint.

Cite this