TY - JOUR
T1 - Robust computation for the shortest Euclidean distance between an ellipse and a coplanar point by closed-form solutions
AU - Wang, Ching Cheng
AU - Lee, Joy
AU - Chen, Lien Wen
AU - Lai, Hsin Yi
PY - 2002/6
Y1 - 2002/6
N2 - An efficient and robust calculation procedure for the shortest Euclidean distance between an ellipse and a coplanar point is explored. Unlike existing iterative search methods, e.g., Newton-Raphson and non-linear programming methods, the proposed method, by adopting Ferraris' and Cardan's solutions, employs only closed-form solutions. Numerical instability causing inaccuracy in results is examined and amended by a robust implementation scheme. Test results are reported.
AB - An efficient and robust calculation procedure for the shortest Euclidean distance between an ellipse and a coplanar point is explored. Unlike existing iterative search methods, e.g., Newton-Raphson and non-linear programming methods, the proposed method, by adopting Ferraris' and Cardan's solutions, employs only closed-form solutions. Numerical instability causing inaccuracy in results is examined and amended by a robust implementation scheme. Test results are reported.
UR - http://www.scopus.com/inward/record.url?scp=0036613640&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0036613640&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0036613640
SN - 0257-9731
VL - 23
SP - 281
EP - 284
JO - Journal of the Chinese Society of Mechanical Engineers, Transactions of the Chinese Institute of Engineers, Series C/Chung-Kuo Chi Hsueh Kung Ch'eng Hsuebo Pao
JF - Journal of the Chinese Society of Mechanical Engineers, Transactions of the Chinese Institute of Engineers, Series C/Chung-Kuo Chi Hsueh Kung Ch'eng Hsuebo Pao
IS - 3
ER -