Skip to main content

Algorithms for Clipping Quadratic Arcs

  • Conference paper

Abstract

New algorithms for 2D quadratic arcs clipping against convex and non-convex windows are presented. Algorithms do not use parametric equations for the arcs description. Therefore only a square root function is needed. The algorithms require information how edges of the given window are oriented. The design, implementation and verification is the first step toward to the quadratic arcs usage in computer graphics as new basic primitives. The presented algorithms have not been published in a literature known to the author.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Cyrus,M., Beck, J. (1979) Generalized Two- and Three Dimensional Clipping, Computers Graphics, Vol.3., No.1., pp.23–28

    Google Scholar 

  • Earnshaw,R.A., Wyvill,B.(Ed.) (1989) New Advances in Computer Graphics, Proceedings Computer Graphics International’89, Leeds, Springer Verlag

    Google Scholar 

  • Foley,J.D., van Dam A. (1982) Fundamentals of Interactive Computer Graphics, Addison Wesley, Reading, Mass.

    Google Scholar 

  • Hansmann,W., Hopgood,F.R.A., Strasser, W.(Ed.) (1989) Conference Proceedings EUROGRAPHICS ’90, Hamburg 1989, North Holland

    Google Scholar 

  • Kilgour,A.C. (1987) Unifying Vector and Polygon Algorithms for Scan Conversion and Clipping, Report CSC 87/R7, Computer Sci. Dept., Univ. of Glasgow

    Google Scholar 

  • Liang,Y.D., Barsky,B.A. (1984) An Analysis and Algorithms for Polygon Clipping, CACM 26, No.11., pp.868–876

    Google Scholar 

  • Liang, Y.D., Barsky, B.A. (1984) A New Concept and Method for Line Clipping, ACM Trans, on Graphics, Vol.3., No.1., pp.1–22

    Article  MATH  Google Scholar 

  • Middleditch,A.E., Stacay,T.W., Tor,S.B. (1989) Intersection Algorithms for Lines and Circles, ACM Trans, on Graphics, Vol. 8.,No.1., pp.25–40

    Article  MATH  Google Scholar 

  • Newman,W.M., Sproull, R.F. (1979) Principles of Interactive Computer Graphics, 2nd ed., McGraw Hill, New York

    Google Scholar 

  • Rodgers,D.F. (1985) Procedural Elements for Computer Graphics, pp. 151–152, McGraw Hill

    Google Scholar 

  • Skala,V. (1989) Algorithms for 2D Line Clipping, inProceedings Computer Graphics International 89 ( Ed. Earnshaw ), pp. 121–128

    Google Scholar 

  • Skala,V. (1989) Algorithms for 2D Line Clipping, in Conference Proceedings EUROGRAPHICS ’90 ( Ed. Hansmann ), pp. 355–366

    Google Scholar 

  • van Vyk,C.J. (1984) Clipping to the Boundary of a Circular Arcs Polygon, Computer Vision, Graphics and Image Processing, Vol.25., No.3.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Tokyo

About this paper

Cite this paper

Skala, V. (1990). Algorithms for Clipping Quadratic Arcs. In: Chua, TS., Kunii, T.L. (eds) CG International ’90. Springer, Tokyo. https://doi.org/10.1007/978-4-431-68123-6_16

Download citation

  • DOI: https://doi.org/10.1007/978-4-431-68123-6_16

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-68125-0

  • Online ISBN: 978-4-431-68123-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics