[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

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

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 71.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 89.99
Price includes VAT (United Kingdom)
  • 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.

Similar content being viewed by others

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

  1. School of Information Science, JAIST, 1-1 Asahidai, Tatsunokuchi, Ishikawa, 923-1292, Japan

    Tetsuo Asano & Shinji Sasahara

  2. Department of Computer Science, City College, CUNY, Convent Avenue at 138th Street, New York, NY, 10031, USA

    Peter Brass

  3. Fuji Xerox Co., Ltd, 430 Sakai, Nakai, Ashigarakami, Kanagawa, 259-0157, Japan

    Shinji Sasahara

Authors
  1. Tetsuo Asano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Brass
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shinji Sasahara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  5. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  6. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

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

Search

Navigation