checkpoint

darcs-hash:20071205051623-5007d-f41148b6d373ea82113f3a5a8ab25bd479785994.gz

diff --git a/src/edu/berkeley/qfat/Mesh.java b/src/edu/berkeley/qfat/Mesh.java
index e06ac65..e530ad7 100644 (file)
--- a/src/edu/berkeley/qfat/Mesh.java
+++ b/src/edu/berkeley/qfat/Mesh.java
@@ -11,7 +11,6 @@ import edu.berkeley.qfat.geom.Point;
 
 public class Mesh implements Iterable<Mesh.T> {
 
-
     public static float EPSILON = (float)0.0001;
     public static Random random = new Random();
 

diff --git a/src/edu/berkeley/qfat/geom/PointSet.java b/src/edu/berkeley/qfat/geom/PointSet.java
index b69edb8..f47a8d5 100644 (file)
--- a/src/edu/berkeley/qfat/geom/PointSet.java
+++ b/src/edu/berkeley/qfat/geom/PointSet.java
@@ -1,11 +1,14 @@
 package edu.berkeley.qfat.geom;
 import edu.wlu.cs.levy.CG.KDTree;
+import java.util.*;
 
 public class PointSet<V extends HasPoint> {
 
     private /*final*/ KDTree kd = new KDTree(3);
     private final double[] doubles = new double[3];
 
+    private HashMap<Point,V> exact = new HashMap<Point,V>();
+
     public void clear() {
         kd = new KDTree(3);
     }
@@ -20,6 +23,7 @@ public class PointSet<V extends HasPoint> {
         } catch (Exception e) {
             throw new Error(e);
         }
+        exact.put(p, v);
     }
 
     public void remove(HasPoint v) { remove(v.getPoint()); }
@@ -30,6 +34,7 @@ public class PointSet<V extends HasPoint> {
         try {
             kd.delete(doubles);
         } catch (Exception e) { }
+        exact.remove(p);
     }
 
     public V nearest(Point p) {