#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef long double db;

void solve()
{
    vector<PII> v(4);
    for (auto& [x, y] : v)
        cin >> x >> y;
    if (v[0].F == v[1].F || v[0].S == v[1].S)
    {
        cout << "1\n";
        return;
    }
    db a, b, alpha, tg, ctg, si, co;
    bool ok = false;
    FOR(i, 0, 4)
    {
        auto [x1, y1] = v[i];
        auto [x2, y2] = v[(i + 1) % 4];
        if (x1 < x2 && y1 < y2)
        {
            auto [x3, y3] = v[(i + 2) % 4];
            a = hypot(x3 - x2, y3 - y2);
            b = hypot(x2 - x1, y2 - y1);
            tg = (db)(y2 - y1) / (x2 - x1);
            ctg = 1 / tg;
            co = 1 / sqrt(tg * tg + 1);
            si = 1 / sqrt(ctg * ctg + 1);
            ok = true;
        }
    }
    assert(ok);
    if (a * co > b * si)
    {
        swap(a, b);
    }
    // outer
    auto f1 = [&](db w, db h)
    {
        db tr = (tg + ctg) * (w * w + h * h);
        db inte = a * b - tr;
        db uni = (a * si + b * co - 2 * w) * (a * co + b * si - 2 * h) + tr;
        return inte / uni;
    };
    // inner
    auto f2 = [&](db w, db h)
    {
        db tr = (b * co - h * ctg - w) * (b * si - w * tg - h);
        db inte = (a * si + b * co - 2 * w) * (a * co + b * si - 2 * h) - tr;
        db uni = a * b + tr;
        return inte / uni;
    };
    auto f = [&](db w, db h)
    {
        if (w < a * si)
        {
            return (a * si - w) * ctg > h ? f1(w, h) : f2(w, h);
        }
        else
        {
            return w * tg - a * si * si / co > h ? f1(w, h) : f2(w, h);
        }
    };
    const db c = (-1 + sqrt(5)) / 2;
    auto g = [&](db w)
    {
        db l = max((db)0, w * tg - a * si * si / co), r = min((a * co + b * si) / 2, w * tg + a * co);
        db m1 = r - c * (r - l), fm1 = f(w, m1),
		    m2 = l + c * (r - l), fm2 = f(w, m2);
        FOR(it, 0, 60)
        {
            if (fm1 > fm2)
            {
                r = m2;
                m2 = m1;
                fm2 = fm1;
                m1 = r - c * (r - l);
                fm1 = f(w, m1);
            }
            else
            {
                l = m1;
                m1 = m2;
                fm1 = fm2;
                m2 = l + c * (r - l);
                fm2 = f(w, m2);
            }
        }
        return f(w, (l + r) / 2);
    };
    db l = 0, r = (a * si + b * co) / 2;
    db m1 = r - c * (r - l), gm1 = g(m1),
        m2 = l + c * (r - l), gm2 = g(m2);
    FOR(it, 0, 60)
    {
        if (gm1 > gm2)
        {
            r = m2;
            m2 = m1;
            gm2 = gm1;
            m1 = r - c * (r - l);
            gm1 = g(m1);
        }
        else
        {
            l = m1;
            m1 = m2;
            gm1 = gm2;
            m2 = l + c * (r - l);
            gm2 = g(m2);
        }
    }
    cout << g((l + r) / 2) << "\n";
    /*db ans = g((l + r) / 2), br = 0;
    const int C = 1000;
    FOR(i, 0, C)
    {
        db w = (a * si + b * co) / 2 * i / C;
        FOR(j, 0, C)
        {
            db h = (a * co + b * si) / 2 * j / C;
            br = max(br, f(w, h));
        }
    }
    cout << ans << " " << br << endl;
    assert(abs(br - ans) < 1e-3);*/
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
    cout << fixed << setprecision(17);
    int t;
    cin >> t;
    while (t--)
        solve();
	return 0;
}