Skip to main content
SpringerLink
Log in

A Two-Dimensional Ellipse–Rectangle Intersection Test

  • Published:
Journal of Mathematical Modelling and Algorithms

Abstract

We present an efficient algorithm for testing whether or not a filled rectangle and a filled ellipse intersect. The algorithm requires at most two evaluations of the quadratic polynomial that defines the ellipse and the execution of a few simple arithmetic expressions. The convexity and monotonicity properties of this polynomial are the main tools for the design of the algorithm.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Drabek, K.: Plane curves and constructions, In: K. Rektorys (ed.), Survey of Applicable Mathematics, MIT Press, Mass., 1969, pp. 150–204.

    Google Scholar 

  2. Faux, I. D. and Pratt, M. J.: Computational Geometry for Design and Manufacture, Wiley, New York, 1979.

    Google Scholar 

  3. Forsythe, G. E.: Pitfalls in computation, or why the math book isn't enough, Amer. Math. Monthly 70 (1970), 931–956.

    Google Scholar 

  4. Foley, J. D., van Dam, A., Feiner, S. K. and Hughes, J.: Computer Graphics, Principles and Practice, Addison-Wesley, Reading, Mass, 1990.

    Google Scholar 

  5. Hill, K. J.: Matrix-based ellipse geometry, In: Alan W. Paeth (ed.), Graphics Gems V, Academic Press, New York, 1995, pp. 73–77.

    Google Scholar 

  6. Kriegel, H.-P., Schmidt, T. and Seidl, T.: Three dimensions similarity search by shape approximation, In: M. Scholl and A. Voisard (eds), Advances in Spatial Databases, Lecture Notes in Comput. Sci. 1262, Springer-Verlag, Berlin, 1997, pp. 11–28.

    Google Scholar 

  7. Klatke, R., Kulisch, U., Wiethoff, A., Lawo, C. and Rauch, M.: C-XSC, Springer, Berlin, 1993.

    Google Scholar 

  8. Levin, J.: A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces, CACM 19 (1976), 555–563.

    Google Scholar 

  9. Moore, R. E.: Interval Analysis, Prentice-Hall, Englewood Cliffs, 1996.

    Google Scholar 

  10. Press, W. H., Flannery, B. P., Teukolsky, S. A. and Wetterling, W. T.: Numerical Recipes in C, Cambridge Univ. Press, Cambridge, 1988.

    Google Scholar 

  11. Ratschek, H. and Rokne, J.: Computer Methods for the Range of Functions, Ellis Horwood, Chichester, 1994.

    Google Scholar 

  12. Ratschek, H. and Rokne, J.: Exact computation of the sign of a finite sum, Appl.Maths. Comput. 99 (1999), 99–127.

    Google Scholar 

  13. Rodgers, D. F. and Adams, J. A.: Mathematical Elements for Computer Graphics, McGraw-Hill, New York, 1990.

    Google Scholar 

  14. Taligent: http://hpsalo.cern.ch/TaligentDocs/TaligentOnline/ DocumentRoot/1.0/Docs/classes/ TGEllipse.html, Internet, 1997.

  15. Zeid, I.: CAD/CAM Theory and Practice, McGraw-Hill, New York, 1991.

    Google Scholar 

  16. Zhou, Y. and Suri, S.: Analysis of a bounding box heuristic for object intersection, J. ACM 46 (1999), 833–857.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut der Universität Düsseldorf, Germany

    H. Ratschek

  2. Department of Computer Science, The University of Calgary, Canada

    Jon Rokne

Authors
  1. H. Ratschek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jon Rokne
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ratschek, H., Rokne, J. A Two-Dimensional Ellipse–Rectangle Intersection Test. Journal of Mathematical Modelling and Algorithms 1, 243–255 (2002). https://doi.org/10.1023/A:1021642308852

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021642308852

Search

Navigation