Advertisement

Online Uniformly Inserting Points on Grid

  • Yong Zhang
  • Zhuo Chang
  • Francis Y. L. Chin
  • Hing-Fung Ting
  • Yung H. Tsin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6124)

Abstract

In this paper, we consider the problem of inserting points in a square grid, which has many background applications, including halftone in reprographic and image processing. We consider an online version of this problem, i.e., the points are inserted one at a time. The objective is to distribute the points as uniformly as possible. Precisely speaking, after each insertion, the gap ratio should be as small as possible. In this paper, we give an insertion strategy with a maximal gap ratio no more than \(2\sqrt{2}\approx 2.828\), which is the first result on uniformly inserting point in a grid. Moreover, we show that no online algorithm can achieve the maximal gap ratio strictly less than 2.5 for a 3×3 grid.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Asano, T.: Online uniformity of integer points on a line. Information Processing Letters 109, 57–60 (2008)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Asano, T., Teramoto, S.: On-line uniformity of points. In: Book of Abstracts for 8th Hellenic-European Conference on Computer Mathematics and its Applications, Athens, Greece, pp. 21–22 (September 2007)Google Scholar
  3. 3.
    Bayer, B.E.: An Optimum Method for Two-Level Rendition of Continuous-Tone Pictures. In: Proceedings of the IEEE International Conference on Communication, pp. 11–26 (1973)Google Scholar
  4. 4.
    Chazelle, B.: The Discrepancy Method: Randomness and Complexity. Cambridge University Press, Cambridge (2000)zbMATHGoogle Scholar
  5. 5.
    Collins, C.R., Stephenson, K.: A circle packing algorithm. Computational Geometry: Theory and Applications 25(3), 233–256 (2003)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Matoušek, J.: Geometric Discrepancy. Springer, Heidelberg (1991)Google Scholar
  7. 7.
    Nurmela, K.J., Östergård, P.R.J.: More Optimal Packings of Equal Circles in a Square. Discrete & Computational Geometry 22(3), 439–457 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Teramoto, S., Asano, T., Katoh, N., Doerr, B.: Inserting points uniformly at every instance. IEICE Trans. Inf. Syst. E89-D(8), 2348–2356 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Yong Zhang
    • 1
    • 2
  • Zhuo Chang
    • 1
  • Francis Y. L. Chin
    • 2
  • Hing-Fung Ting
    • 2
  • Yung H. Tsin
    • 3
  1. 1.College of Mathematics and Computer ScienceHebei UniversityChina
  2. 2.Department of Computer ScienceThe University of Hong KongHong Kong
  3. 3.School of Computer ScienceUniversity of WindsorCanada

Personalised recommendations