鉴于每个囚室的电网分布图,每个囚室都可以用乳房(x, y)和这种囚室的矢量加以描述,我(自然)如何检查这些囚室是否构成隧道,如。 它们是:
All are lines up Most are lined up Not lined up
C C C C
C C C C C C C C C C C C C C C C C C C C
C C C C C
C C
您可计算X和Y坐标的标准偏差。 你的囚室越 tunnel,X或Y的偏离就越小。
例如,在沙尔:
import numpy
def is_tunnelled(cells):
# given cells=[(x,y), (x,y),...]
x_values, y_values = zip(*cells)
lowest_std_dev = min(numpy.std(x_values), numpy.std(y_values))
return lowest_std_dev < STD_DEVIATION_THRESHOLD
应由你来决定STD_DEVIATION——的价值。 也应该如此。
You could do a histogram of the x and y coordinates of the cells. If all cells are lined up horizontally, you get only one y-value in your histogramm and lots of consecutive x-values, which all occur only one times. Vertically is the same with x and y flipped.
If you want to check, if most of them are lined up, search for the value in the histogram, which has the most occurences (longest possible tunnel) and check the cells with that x or y-coordinate, if they are lined up (that is: their y or x-coordinates (depending on wheter x or y was used in the previous step) are consecutive without a gap (maybe sort them first)) If they are not, search for the second highest occurrence value, ...
如果你通过首先检查其<代码>y坐标为平方,则通过<代码>x对左边进行协调和反向,以检查差距。 利用对面坐标检查垂直隧道。
For the approximate check you will have to clarify what you mean by "most".
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 "...