我有三点坐标。 请打电话给他们X1、Y1、X2、Y2、X3 Y3。
我需要计算X4,Y4,但我知道:
X1,Y1 is 350 units in distance from X4,Y4 X2,Y2 is 200 units in distance from X4,Y4 X3,Y3 is 50 units in distance from X4,Y4
Inow The Exact Values for X1,Y1, X2,Y2, and X3,Y3
我如何确定X4,Y4的确切地点?
我有三点坐标。 请打电话给他们X1、Y1、X2、Y2、X3 Y3。
我需要计算X4,Y4,但我知道:
X1,Y1 is 350 units in distance from X4,Y4 X2,Y2 is 200 units in distance from X4,Y4 X3,Y3 is 50 units in distance from X4,Y4
Inow The Exact Values for X1,Y1, X2,Y2, and X3,Y3
我如何确定X4,Y4的确切地点?
(x - x1)^2 + (y - y1)^2 = r1^2 ------ p
(x - x2)^2 + (y - y2)^2 = r2^2 ------ q
(x - x3)^2 + (y - y3)^2 = r3^2 ------ r
这三个圈子的交汇点。
p - q ----- l
p - r ----- n
http://en.wikipedia.org/wiki/Cramer%27s_rule”rel=“nofollow noreferer”>Cramer s Rule。
GET_POINT(x1,y1,r1,x2,y2,r2,x3,y3,r3):
A = x1 - x2
B = y1 - y2
D = x1 - x3
E = y1 - y3
T = (r1*r1 - x1*x1 - y1*y1)
C = (r2*r2 - x2*x2 - y2*y2) - T
F = (r3*r3 - x3*x3 - y3*y3) - T
A x + B y = C/2 // this is equation l
D x + E y = F/2 // this is equation n
// Cramer s Rule
Mx = (C E - B F) /2
My = (A F - D C) /2
M = AE - DB
x = Mx/M
y = My/M
return (x,y)
你的职位只贴上“地理”。
解决贵问题的一个几何解决方案是将环绕(x1,y1)、(x2,y2)和(x3,y3)的圈子连接到(x4,y4)作为rad。 (x4,y4)是所有 the圈之间交织点。
If I have an algorithm which is comprised of (let s say) three sub-algorithms, all with different O() characteristics, e.g.: algorithm A: O(n) algorithm B: O(log(n)) algorithm C: O(n log(n)) How do ...
I m using Electro in Lua for some 3D simulations, and I m running in to something of a mathematical/algorithmic/physics snag. I m trying to figure out how I would find the "spin" of a sphere of a ...
There s a (relatively) new sort on the block called Timsort. It s been used as Python s list.sort, and is now going to be the new Array.sort in Java 7. There s some documentation and a tiny Wikipedia ...
As a learning experience I recently tried implementing Quicksort with 3 way partitioning in C#. Apart from needing to add an extra range check on the left/right variables before the recursive call, ...
Given a 10 digit Telephone Number, we have to print all possible strings created from that. The mapping of the numbers is the one as exactly on a phone s keypad. i.e. for 1,0-> No Letter for 2->...
I have a directed graph and my problem is to enumerate all the minimal (cycles that cannot be constructed as the union of other cycles) directed cycles of this graph. This is different from what the ...
Given an array of integers arr = [5, 6, 1]. When we construct a BST with this input in the same order, we will have "5" as root, "6" as the right child and "1" as left child. Now if our input is ...
I was trying to speed up a certain routine in an application, and my profiler, AQTime, identified one method in particular as a bottleneck. The method has been with us for years, and is part of a "...