Examples of Intersection


Examples of jpbrt.core.Intersection

    }
   
    @Override
    public Intersection intersect(Ray ray)
    {
        Intersection result = new Intersection();
       
        // compute s1 = d x e2
        Point p1 = mesh.p[v1];
        Point p2 = mesh.p[v2];
        Point p3 = mesh.p[v3];
View Full Code Here

Examples of org.neo4j.gis.spatial.pipes.processing.Intersection

   
    /**
     * @see Intersection
     */
    public GeoPipeline intersect(Geometry geometry) {
      return addPipe(new Intersection(geometry));
    }
View Full Code Here

Examples of org.openrdf.query.algebra.Intersection

    throws VisitorException
  {
    TupleExpr leftArg = (TupleExpr)node.getLeftArg().jjtAccept(this, null);
    TupleExpr rightArg = (TupleExpr)node.getRightArg().jjtAccept(this, null);

    return new Intersection(leftArg, rightArg);
  }
View Full Code Here

Examples of org.openrdf.query.algebra.Intersection

    throws VisitorException
  {
    TupleExpr leftArg = (TupleExpr)node.getLeftArg().jjtAccept(this, null);
    TupleExpr rightArg = (TupleExpr)node.getRightArg().jjtAccept(this, null);

    return new Intersection(leftArg, rightArg);
  }
View Full Code Here

Examples of org.openrdf.query.algebra.Intersection

    throws VisitorException
  {
    TupleExpr leftArg = (TupleExpr)node.getLeftArg().jjtAccept(this, null);
    TupleExpr rightArg = (TupleExpr)node.getRightArg().jjtAccept(this, null);

    return new Intersection(leftArg, rightArg);
  }
View Full Code Here

Examples of org.openrdf.query.algebra.Intersection

    throws VisitorException
  {
    TupleExpr leftArg = (TupleExpr)node.getLeftArg().jjtAccept(this, null);
    TupleExpr rightArg = (TupleExpr)node.getRightArg().jjtAccept(this, null);

    return new Intersection(leftArg, rightArg);
  }
View Full Code Here

Examples of org.openstreetmap.josm.data.osm.visitor.paint.relations.Multipolygon.PolyData.Intersection

                boolean outside = true;
                boolean crossing = false;
                List<Node> outerWay = null;
                for (int i=0; i<outerWays.size(); i++) {
                    GeneralPath outer = outerPolygons.get(i);
                    Intersection intersection = getPolygonIntersection(outer, pdInner);
                    outside = outside & intersection == Intersection.OUTSIDE;
                    if (intersection == Intersection.CROSSING) {
                        crossing = true;
                        outerWay = outerWays.get(i);
                    }
View Full Code Here

Examples of wolf.city.road.Intersection

      Coordinate startPoint = new Coordinate(x,y);
      double angle = Math.toDegrees(Angle.angle(startPoint, new Coordinate(0,0)));
      Turtle t = new Turtle(startPoint, angle);
      //t.turn(45);
      t.move(32);
      roadQueue.add(new Road(new Intersection(startPoint), new Intersection(t.pos), RoadType.HIGHWAY, basicRule));
    }
    int highwayCount = Math.max((city.sizeX*2+city.sizeY*2)/(3*1024),1);
    for(int i=0; i<highwayCount; i++){
      //highway from random side
      int direction = Math.abs(city.random.nextInt()%4);
      float length = 128;
      switch(direction){
      case 0:{ //North
        log.log("Highway from the north");
        float x = (float) ((this.city.random.nextFloat()-.5)*city.sizeX); //can place in center half of city
        Coordinate startPoint = new Coordinate(x, city.sizeY/2);
        Turtle t = new Turtle(startPoint, ((city.random.nextDouble()*180)%seedHighwayAngleSize)+270);
        t.move(length);
        roadQueue.add(new Road(new Intersection(startPoint), new Intersection(t.pos), RoadType.HIGHWAY, basicRule));
        break;
      }
      case 1:{ //South
        log.log("Highway from the south");
        float x = (float) ((this.city.random.nextFloat()-.5)*city.sizeX); //can place in center half of city
        Coordinate startPoint = new Coordinate(x, -city.sizeY/2);
        Turtle t = new Turtle(startPoint, ((city.random.nextDouble()*180)%seedHighwayAngleSize)+90);
        t.move(length);
        roadQueue.add(new Road(new Intersection(startPoint), new Intersection(t.pos), RoadType.HIGHWAY, basicRule));
        break;
      }
      case 2:{ //East
        log.log("Highway from the east");
        float y = (float) ((this.city.random.nextFloat()-.5)*city.sizeY);
        Coordinate startPoint = new Coordinate(-city.sizeX/2, y);
        Turtle t = new Turtle(startPoint, ((city.random.nextDouble()*180)%seedHighwayAngleSize)+0);
        t.move(length);
        roadQueue.add(new Road(new Intersection(startPoint), new Intersection(t.pos), RoadType.HIGHWAY, basicRule));
        break;
      }
      case 3:{ //West
        log.log("Highway from the west");
        float y = (float) ((this.city.random.nextFloat()-.5)*city.sizeY);
        Coordinate startPoint = new Coordinate(city.sizeX/2, y);
        Turtle t = new Turtle(startPoint, ((city.random.nextDouble()*180)%seedHighwayAngleSize)+180);
        t.move(length);
        roadQueue.add(new Road(new Intersection(startPoint), new Intersection(t.pos), RoadType.HIGHWAY, basicRule));
        break;
      }
      default:{
        System.out.println("You done goofed. Check the seedRoadMap function's direction variable");
      }
View Full Code Here

Examples of wolf.city.road.Intersection

  @Override
  public void asOBJ(OBJ obj) {
    obj.startObject("roads");
   
    for(int i=0; i<Intersection.intersections.size(); i++){
      Intersection is = Intersection.intersections.get(i);
      if(is.connecting.size() > 1){ //if there is more than one road to make an intersection out of
        ArrayList<LineSegment> segments0 = new ArrayList<LineSegment>();
        ArrayList<LineSegment> segments1 = new ArrayList<LineSegment>();
        //compute intersection points and max radius of roads (minimum value for roadExtrusion value)
        double maxRadius = 0;
View Full Code Here

Examples of wolf.city.road.Intersection

      //render intersections
      GL11.glPointSize(5);
      GL11.glBegin(GL11.GL_POINTS);
      GL11.glColor3f(1, 1, 0);
      for(int i=0; i<roads.size(); i++){
        Intersection a = roads.get(i).a;
        Coordinate p = a.pos;
        GL11.glVertex2d(p.x+c.sizeX/2,vSize-(p.y+c.sizeY/2));
      }
      }
      GL11.glEnd();
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.