initial implementation (10/100)

Author: proton

week5/balanced-search-trees/assignment-kd-trees/KdTree.java

@@ -0,0 +1,63 @@
+import java.util.TreeSet;
+import java.util.ArrayList;
+import edu.princeton.cs.algs4.Point2D;
+import edu.princeton.cs.algs4.RectHV;
+
+public class KdTree {
+  private TreeSet<Point2D> tree;
+
+  // construct an empty set of points
+  public KdTree() {
+    this.tree = new TreeSet<Point2D>();
+  }
+  // is the set empty?
+  public boolean isEmpty() {
+    return this.tree.isEmpty();
+  }
+  // number of points in the set
+  public int size() {
+    return tree.size();
+  }
+  // add the point to the set (if it is not already in the set)
+  public void insert(Point2D p) {
+    tree.add(p);
+  }
+  // // does the set contain point p?
+  public boolean contains(Point2D p) {
+    return tree.contains(p);
+  }
+  // draw all points to standard draw
+  public void draw() {
+    for (Point2D p : tree) {
+      p.draw();
+    }
+  }
+  // all points that are inside the rectangle (or on the boundary)
+  public Iterable<Point2D> range(RectHV rect) {
+    ArrayList<Point2D> points = new ArrayList<Point2D>();
+    for (Point2D p : tree) {
+      if (rect.contains(p)) {
+        points.add(p);
+      }
+    }
+    return points;
+  }
+  // // a nearest neighbor in the set to point p; null if the set is empty
+  public Point2D nearest(Point2D p) {
+    Point2D nearest = null;
+    double minDistance = Double.POSITIVE_INFINITY;
+    for (Point2D point : tree) {
+      double distance = p.distanceSquaredTo(point);
+      if (distance < minDistance) {
+        nearest = point;
+        minDistance = distance;
+      }
+    }
+    return nearest;
+  }
+
+  // unit testing of the methods (optional)
+  public static void main(String[] args) {
+    // TODO:
+  }
+}

week5/balanced-search-trees/assignment-kd-trees/PointSET.java

@@ -0,0 +1,63 @@
+import java.util.TreeSet;
+import java.util.ArrayList;
+import edu.princeton.cs.algs4.Point2D;
+import edu.princeton.cs.algs4.RectHV;
+
+public class PointSET {
+  private TreeSet<Point2D> tree;
+
+  // construct an empty set of points
+  public PointSET() {
+    this.tree = new TreeSet<Point2D>();
+  }
+  // is the set empty?
+  public boolean isEmpty() {
+    return this.tree.isEmpty();
+  }
+  // number of points in the set
+  public int size() {
+    return tree.size();
+  }
+  // add the point to the set (if it is not already in the set)
+  public void insert(Point2D p) {
+    tree.add(p);
+  }
+  // // does the set contain point p?
+  public boolean contains(Point2D p) {
+    return tree.contains(p);
+  }
+  // draw all points to standard draw
+  public void draw() {
+    for (Point2D p : tree) {
+      p.draw();
+    }
+  }
+  // all points that are inside the rectangle (or on the boundary)
+  public Iterable<Point2D> range(RectHV rect) {
+    ArrayList<Point2D> points = new ArrayList<Point2D>();
+    for (Point2D p : tree) {
+      if (rect.contains(p)) {
+        points.add(p);
+      }
+    }
+    return points;
+  }
+  // // a nearest neighbor in the set to point p; null if the set is empty
+  public Point2D nearest(Point2D p) {
+    Point2D nearest = null;
+    double minDistance = Double.POSITIVE_INFINITY;
+    for (Point2D point : tree) {
+      double distance = p.distanceTo(point);
+      if (distance < minDistance) {
+        nearest = point;
+        minDistance = distance;
+      }
+    }
+    return nearest;
+  }
+
+  // unit testing of the methods (optional)
+  public static void main(String[] args) {
+    // TODO:
+  }
+}