|
|
back to boardI got Accepted using this approach divide three euler angle into 50 pieces each of them is 2*pi/50;enum each euler angles and
compute minmimum max different of distance to three faces.
for(alpha=0;alpha<=2*pi;alpha+=dtheta)
{
if(min_dist>compute(alpha))
{
min_dist=compute(alpha);
ch=alpha;
}
}
low=ch-dtheta;
high=ch+dtheta;
then ternary search [low,high]..
Do you understand? Re: I got Accepted using this approach hahaha ,15 ms... Re: I got Accepted using this approach Posted by Orient 28 Jan 2018 18:16 Can it be solved using QR-decomposition? |
|
|
