Name
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1023/A:1021642308852 | J. Math. Model. Algorithms |
Keywords | Field | DocType |
intersection tests, ellipses | Discrete mathematics,Monotonic function,Combinatorics,Mathematical optimization,Convexity,Polynomial,Rectangle,Quadratic function,Arithmetic expressions,Ellipse,Mathematics,The Intersect | Journal |
Volume | Issue | ISSN |
1 | 4 | 1572-9214 |
Citations | PageRank | References |
2 | 0.48 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Helmut Ratschek | 1 | 53 | 13.49 |
| Jon G. Rokne | 2 | 263 | 45.63 |