Area-Feature Boundary Labeling

Publication Date

September 2009

Document Type

Article

Publication Title

The Computer Journal

Volume

53

Issue

6

DOI

10.1093/comjnl/bxp087

First Page

827

Last Page

841

Abstract

Boundary labeling is a relatively new labeling method. It can be useful in automating the production of technical drawings and medical drawings, where it is common to explain certain parts of the drawing with text labels, arranged on its boundary so that other parts of the drawing are not obscured. In boundary labeling, we are given a rectangle R which encloses a set of n sites. Each site s is associated with an axis-parallel rectangular label ls. The labels must be placed in distinct positions on the boundary of R and they must be connected to their corresponding sites with polygonal lines, called leaders, so that the labels are pairwise disjoint and the leaders do not intersect each other. In this paper, we study a version of the boundary labeling problem where the sites can ‘float’ within a polygonal region. We present a polynomial time algorithm, which runs in O(n3) time and produces a labeling of minimum total leader length for labels of uniform size placed in fixed positions on the boundary of rectangle R.

Keywords

Boundary labeling, technical drawings, medical drawings, polygonal lines, polynomial time algorithm

Comments

SJSU users: Use the following link to login and access this article via SJSU databases.

Link to Full Text

Share

COinS