Title :
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.
Keywords :
computational geometry; decision theory; arithmetic mean-midpoint decision variable; conic polar-line; minimum Euclidean distance; sign corrected midpoint decision variable; two-point decision variable; Arithmetic; Computer errors; Computer numerical control; Displays; Euclidean distance; History; Interpolation; Mesh generation; Solid modeling; Surface fitting; Approximation of surfaces and contours; Bresenham; Conics; Curve/surface fitting; Display algorithms; Drawing of implicit functions; Interpolation; Intersection; Line and curve generation; Midpoint; Numerical control; Rendering; Scan-conversion;
Conference_Titel :
Geometric Modeling and Imaging, 2008. GMAI 2008. 3rd International Conference on
Conference_Location :
London
Print_ISBN :
978-0-7695-3270-7
DOI :
10.1109/GMAI.2008.8
