Skip to main content

Disc Covering Problem with Application to Digital Halftoning

  • Conference paper
Computational Science and Its Applications – ICCSA 2004 (ICCSA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3045))

Included in the following conference series:

Abstract

One of the popular geometric optimization problems is that of finding the maximum radius r n of n equal and non-overlapping discs to be packed in a unit square. It has been widely explored with a number of surprising results (see e.g. [2]).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asano, T., Matsui, T., Tokuyama, T.: Optimal Roundings of Sequences and Matrices. Nordic Journal of Computing 7(3), 241–256 (2000)

    MATH  MathSciNet  Google Scholar 

  2. Nurmela, K.J., Oestergard, P.R.J.: Packing up to 50 Equal Circles in a Square. Discrete Comput. Geom. 18, 111–120 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ostromoukhov, V.: Pseudo-Random Halftone Screening for Color and Black&White Printing. In: Proceedings of the 9th Congress on Advances in Non-Impact Printing Technologies, Yokohama, pp. 579–581 (1993)

    Google Scholar 

  4. Ostromoukhov, V., Hersch, R.D.: Stochastic Clustered-Dot Dithering. Journal of Electronic Imaging 8(4), 439–445 (1999)

    Article  Google Scholar 

  5. Sasahara, S., Asano, T.: Adaptive Cluster Arrangement for Cluster-dot Halftoning Using Bubble Packing Method. In: Proceeding of 7th Japan Korea Joint Workshop on Algorithms and Computation, Sendai, July 2003, pp. 87–93 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Asano, T., Brass, P., Sasahara, S. (2004). Disc Covering Problem with Application to Digital Halftoning. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24767-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24767-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22057-2

  • Online ISBN: 978-3-540-24767-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics