blob: 5500512662ec54a26600f509cb5b95cd87fb45e3 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
/* vim: set expandtab tabstop=4 shiftwidth=4 : */
import java.util.TreeSet;
public class PointSET
{
private TreeSet<Point2D> set;
// construct an empty set of points
public PointSET()
{
set = new TreeSet<Point2D>();
}
// is the set empty?
public boolean isEmpty()
{
return set.isEmpty();
}
// number of points in the set
public int size()
{
return set.size();
}
// add the point p to the set (if it is not already in the set)
public void insert(Point2D p)
{
set.add(p);
}
// does the set contain the point p?
public boolean contains(Point2D p)
{
return set.contains(p);
}
// draw all of the points to standard draw
public void draw()
{
for (Point2D p : set) p.draw();
}
// all points in the set that are inside the rectangle
public Iterable<Point2D> range(RectHV rect)
{
Stack<Point2D> stack = new Stack<Point2D>();
for (Point2D p : set)
if (rect.contains(p)) stack.push(p);
return stack;
}
// a nearest neighbor in the set to p; null if set is empty
public Point2D nearest(Point2D p)
{
if (set.isEmpty()) return null;
Point2D p0 = null;
double d = Double.MAX_VALUE;
for (Point2D o : set)
{
double d2 = p.distanceSquaredTo(o);
if (d2 < d) {
d = d2;
p0 = o;
}
}
return p0;
}
}
|
