Chapter 3: The Sign Corrected Midpoint Decision Variable Selects the Candidate Point with the Minimum Euclidean Distance to the Conic

Abstract

You can expect many new things: 1. An efficient 8-connected algorithm calculating the minimum Euclidean distance to the conic. 2. Bounding the Euclidean distance with the arithmetic mean and midpoint decision variable. 3. Highlighting the out-of-tolerance cases and the formulation of a solution. 4. Restore the renounced two-point decision variable(s). 5. Clear up the midpoint decision variable, by introducing the polar-line of the conic.