# New Algorithms for Two-Label Point Labeling

@inproceedings{Qin2000NewAF, title={New Algorithms for Two-Label Point Labeling}, author={Zhongping Qin and Alexander Wolff and Yin-Feng Xu and Binhai Zhu}, booktitle={ESA}, year={2000} }

- Published in ESA 2000
DOI:10.1007/3-540-45253-2_34

Given a label shape L and a set of n points in the plane, the 2-label point-labeling problem consists of placing 2n nonintersecting translated copies of L of maximum size such that each point touches two unique copies--its labels. In this paper we give new and simple approximation algorithms for L an axis-parallel square or a circle. For squares we improve the best previously known approximation factor from 1/3 to 1/2 . For circles the improvement from 1/2 to ≈ 0.513 is less significant, but… CONTINUE READING

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 18 CITATIONS

## A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling

VIEW 10 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Incremental labeling in closed-2PM model

VIEW 1 EXCERPT

CITES METHODS

## Trimming of Graphs, with Application to Point Labeling

VIEW 1 EXCERPT

CITES BACKGROUND

## Trimming of Graphs, with Application to Point Labeling

VIEW 1 EXCERPT

CITES BACKGROUND

## An efficient algorithm for label updating in 2PM model to avoid a moving object

VIEW 1 EXCERPT

CITES BACKGROUND

## Map labeling with circles

VIEW 3 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-5 OF 5 REFERENCES