Related Experiment Video
Updated: Aug 6, 2026

Robotized Testing of Camera Positions to Determine Ideal Configuration for Stereo 3D Visualization of Open-Heart Surgery
Published on: August 12, 2021
Easy conic intersection with the common self-polar triangle
Michela Mancini1, John A Christian1
1Guggenheim School of Aerospace Engineering, Georgia Institute Of Technology, Atlanta, Georgia, United States of America.
This study presents a straightforward method for finding conic intersections by transforming projective coordinates. The technique simplifies the problem into solving a cubic eigenvalue problem and a quadratic equation.
Area of Science:
- Computational Geometry
- Computer Vision
- Algebraic Geometry
Background:
- Conic intersection is a fundamental problem in geometry with applications in computer vision and graphics.
- Conics, or degree-two curves, are frequently used to model real-world objects and their projections.
Purpose of the Study:
- To introduce a novel and simplified method for solving the conic intersection problem.
- To provide an explicit algorithmic solution suitable for practical applications.
Main Methods:
- The proposed method utilizes a change of projective coordinates.
- It leverages the properties of self-polar triangles to simplify the intersection calculation.
- The core of the method involves solving a cubic eigenvalue problem and a quadratic equation.
Main Results:
- The self-polar triangle method reduces the complex conic intersection problem to a more manageable eigenvalue problem.
- This approach offers a computationally efficient and direct solution.
Conclusions:
- The self-polar triangle method provides an attractive and simple alternative to existing conic intersection algorithms.
- This technique is particularly valuable in scenarios demanding explicit and efficient computational solutions.
Related Concept Videos
Polar Equations of Conics
Graphs of Polar Equations
Hyperbolas
Polar Coordinates
Trigonometric Identities III
Trigonometric Identities I
