i think part of my problem (why i'm not always getting win), is that i do not guarantee that the simplex contains the point (especially with the random clounds; i think that the connectivity-based lookup is doing that fine

2010-03-18 23:50:40 -06:00
parent 9836fdcbfe
commit f089848a1b
2 changed files with 18 additions and 8 deletions
@@ -111,8 +111,10 @@ def run_baker(X, R, S):
    S = extra points
  """

-  # calculate values only for the triangle
+  # calculate values only for the simplex triangle
  phi, qlin = qlinear(X, R)
+  if [i for i in phi if i <= 0.0]:
+    print "failure"

  if len(S.points) == 0:
    answer = {