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}
}
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
BETA

Topics from this paper.

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

An empiri al study of algorithms forpoint - feature label pla ement

H.-P. Lenhof, C. S hwarz, M. Smid
  • ACM Transa tions on Graphi s
  • 1995

Voronoi diagrams : A survey of a fundamental geometri datastru ture

S. Shieber
  • ACM Comput . Surv .
  • 1991

An expert system for dense - map name pla e - ment

A. Itai, A. Shamir
  • In Pro . Auto - Carto
  • 1989

A polynomial time solution for labeling are tilinear map

F. Chin
  • SIAM J . Dis r . Math .

A polynomial time solution for labeling are tilinear map

F. Chin
  • SIAM J . Dis r . Math .