Package rlforj.math

Examples of rlforj.math.Point2I

297
298
299
300
301
302
303
304
   
    @Override
    public boolean isObstacle(int x, int y)
    {
      System.out.println("isObs "+x+" "+y);
      obsNotVisited.add(new Point2I(x, y));
      return super.isObstacle(x, y);
    }
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
  {
    if(path.size()<1) return;
   
    int lastx=path.get(0).x, lasty=path.get(0).y;
    for(int i=1; i<path.size(); i++) {
      Point2I p=path.get(i);
      int x=p.x, y=p.y;
      if(x!=lastx) {
        if(y!=lasty) {
          b.mark(x, y, ((x-lastx)*(y-lasty)>0)?'\\':'/');
        } else
View Full Code Here
30
31
32
33
34
35
36
    marks.clear();
    visited = new boolean[w][h];
  }

  public void mark(int x, int y, char c) {
    marks.put(new Point2I(x, y), c);
  }
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
  {
    visited[x][y]=true;
  }
 
  public void print(int ox, int oy) {
    Point2I p=new Point2I(0, 0);
    for(int j=0; j<h; j++) {
      for(int i=0; i<w; i++) {
        p.x=i; p.y=j;
        Character c=marks.get(p);
        if(c!=null) System.out.print(c);
View Full Code Here
70
71
72
73
74
75
76
77
78
79
80
                {
                    assertFalse("A point on A* path was an obstacle", m.isObstacle(step.x, step.y));
                }
               
                // Check continuity
                Point2I lastStep = null;
                for (Point2I step: path)
                {
                    if (lastStep == null)
                    {
                        lastStep = step;
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
                    board[i][j] = EMPTY;
            }
        }
       
        ArrayList<Point2I> l = new ArrayList<Point2I>(width * height);
        l.add(new Point2I(x1, y1));
        while(!l.isEmpty())
        {
            Point2I p1 = l.remove(l.size() - 1);
            for(Directions d: Directions.N8)
            {
                Point2I p2 = new Point2I(p1.x+d.dx(), p1.y+d.dy());
                if (!mb.contains(p2.x, p2.y) || board[p2.x][p2.y] != EMPTY)
                    continue;
               
                board[p2.x][p2.y] = COLOR;
                l.add(p2);
View Full Code Here
TOP

Related Classes of rlforj.math.Point2I

  • rlforj.examples.ExampleBoard
  • rlforj.examples.ProjectionExample
  • rlforj.los.BresLos
  • rlforj.los.BresOpportunisticLos
  • rlforj.los.ConePrecisePremisive
  • rlforj.los.GenericCalculateProjection
  • rlforj.los.PrecisePermissive
  • rlforj.los.PrecisePermissive$fieldT
  • rlforj.los.raymulticast.MultiRaysCaster
  • rlforj.los.raymulticast.MultiRaysCaster$TestBoard1
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.