A two-dimensional ellipse-rectangle intersection test

DOI10.1023/A:1021642308852MaRDI QIDQ1868501zbMATH OpenOpenAlexFDO

Authors H. Ratschek, J. Rokne

Publication date 27 April 2003

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1021642308852

zbMATH Keywords

ellipseellipse-rectangle intersection algorithmintersection testsinterval analysisrectangle

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) General methods in interval analysis (65G40)

Review text

An ellipse-rectangle intersection algorithm is developed based on interval analytic considerations. It works with an axis-aligned rectangle and an arbitrary ellipse. The algorithm requires at most two evaluations of the quadratic polynomial that defines the ellipse and some simple arithmetic expressions.

Recommendations

• Test for intersection between circle and rectangle
• Detecting the intersection of convex objects in the plane
• scientific article; zbMATH DE number 2130870
• Solving the interference problem for ellipses and ellipsoids: new formulae
• A new linear algorithm for intersecting convex polygons

Cited in

(3)

• Test for intersection between circle and rectangle
• scientific article; zbMATH DE number 429175 (Why is no real title available?)
• Calculating ellipse overlap areas

This page was built for publication: A two-dimensional ellipse-rectangle intersection test

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1868501)