Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Fast algorithms for minimum matrix norm with application in computer graphics

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In this paper we consider the following problem. Given (r 1,r 2, ...,r n)∈ R n, for anyI= (I 1,I 2,...,I n)∈ Z n, letE 1=(e ij), wheree ij=(r i−rj)−(I i−Ij), findI ∈ Z n such that |E I| is minimized, where |·| is a matrix norm. This problem arises from optimal curve rasterization in computer graphics, where minimum distortion of curve dynamic context is sought. Until now, there has been no polynomial-time solution to this computer graphics problem. We present a very simpleO(n lgn)-time algorithm to solve this problem under various matrix norms.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. E. Bresenham, Algorithm for computer control of digital plotting,IBM Systems J.,4 (1965), 25–30.

    Google Scholar 

  2. C. E. Kim, On the cellular convexity of complexes,IEEE Trans. Pattern Anal. Mack Intell.,3 (1981), 617–625.

    Google Scholar 

  3. A. Rosenfeld, Arcs and curves in digital pictures,J. Assoc. Comput. Mach.,20(1) (1973), 81–87.

    Google Scholar 

  4. S. Tang, X. Wu, and K. Zhang, On optimal line rasterization,Proc. Computer Graphics International, Tokyo, June 1992, 661–671.

  5. X. Wu, An efficient antialiasing technique,Comput. Graphics,25(4) (1991), 143–152.

    Google Scholar 

  6. X. Wu and J. Rokne, Dynamic error measure for curve scan-conversion,Proc. Graphics/Interface '89, London, Ontario, 1989, pp. 183–190.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Beijing Computer Institute, Beijing, China

    Shouwen Tang

  2. Department of Computer Science, University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Kaizhong Zhang & Xiaolin Wu

Authors
  1. Shouwen Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kaizhong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaolin Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by D. T. Lee.

This research was supported by the Natural Sciences and Engineering Research Council of Canada under Grant OGP0046373.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tang, S., Zhang, K. & Wu, X. Fast algorithms for minimum matrix norm with application in computer graphics. Algorithmica 15, 68–81 (1996). https://doi.org/10.1007/BF01942607

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01942607

Key words

Search

Navigation