congrats Icon
New! Tabnine Pro 14-day free trial
Start a free trial
Tabnine Logo
TPoint.<init>
Code IndexAdd Tabnine to your IDE (free)

How to use
org.poly2tri.triangulation.point.TPoint
constructor

Best Java code snippets using org.poly2tri.triangulation.point.TPoint.<init> (Showing top 9 results out of 315)

origin: org.orbisgis/poly2tri-core

public static List<TriangulationPoint> uniformDistribution( int n, double scale )
{
  ArrayList<TriangulationPoint> points = new ArrayList<TriangulationPoint>();
  for( int i=0; i<n; i++ )
  {
    points.add( new TPoint( scale*(0.5 - Math.random()), scale*(0.5 - Math.random()) ) );
  }
  return points;
}
 
origin: org.orbisgis/h2gis-functions

protected int addPt(Coordinate coordinate) {
  TPoint pt = new TPoint(delaunayData.r(coordinate.x), delaunayData.r(coordinate.y),
      Double.isNaN(coordinate.z) ? 0 : delaunayData.r(coordinate.z));
  Integer index = pts.get(pt);
  if(index == null) {
    index = maxIndex.getAndAdd(1);
    pts.put(pt, index);
  }
  return index;
}
origin: orbisgis/h2gis

protected int addPt(Coordinate coordinate) {
  TPoint pt = new TPoint(delaunayData.r(coordinate.x), delaunayData.r(coordinate.y),
      Double.isNaN(coordinate.z) ? 0 : delaunayData.r(coordinate.z));
  Integer index = pts.get(pt);
  if(index == null) {
    index = maxIndex.getAndAdd(1);
    pts.put(pt, index);
  }
  return index;
}
origin: org.orbisgis/h2gis

protected int addPt(Coordinate coordinate) {
  TPoint pt = new TPoint(delaunayData.r(coordinate.x), delaunayData.r(coordinate.y),
      Double.isNaN(coordinate.z) ? 0 : delaunayData.r(coordinate.z));
  Integer index = pts.get(pt);
  if(index == null) {
    index = maxIndex.getAndAdd(1);
    pts.put(pt, index);
  }
  return index;
}
origin: org.orbisgis/poly2tri-core

  public static List<TriangulationPoint> uniformGrid( int n, double scale )
  {
    double x=0;
    double size = scale/n;
    double halfScale = 0.5*scale;
    
    ArrayList<TriangulationPoint> points = new ArrayList<TriangulationPoint>();
    for( int i=0; i<n+1; i++ )
    {
      x =  halfScale - i*size;
      for( int j=0; j<n+1; j++ )
      {
        points.add( new TPoint( x, halfScale - j*size ) );
      }
    }
    return points;        
  }
}
origin: kendzi/kendzi3d

  @Override
  public void prepareTriangulation(TriangulationContext<?> tcx) {
    triangles.clear();
    for (LineSegment2d l : segmentSet) {
      TriangulationPoint tp1, tp2;
      if (!pointSet.containsKey(l.getBegin())) {
        tp1 = new TPoint(l.getBegin().x, l.getBegin().y);
        pointSet.put(l.getBegin(), tp1);
        points.add(tp1);
      } else {
        tp1 = pointSet.get(l.getBegin());
      }
      if (!pointSet.containsKey(l.getEnd())) {
        tp2 = new TPoint(l.getEnd().x, l.getEnd().y);
        pointSet.put(l.getEnd(), tp2);
        points.add(tp2);
      } else {
        tp2 = pointSet.get(l.getEnd());
      }
      tcx.newConstraint(tp1, tp2);
    }
    segmentSet.clear();
    pointSet.clear();
    tcx.addPoints(points);
  }
}
origin: kendzi/kendzi3d

TPoint tp = new TPoint(p.x, p.y);
pointSet.put(p, tp);
points.add(tp);
origin: org.orbisgis/poly2tri-core

public TPoint centroid()
{
  double cx = ( points[0].getX() + points[1].getX() + points[2].getX() ) / 3d;
  double cy = ( points[0].getY() + points[1].getY() + points[2].getY() ) / 3d;
  return new TPoint( cx, cy );
}
origin: org.orbisgis/poly2tri-core

TPoint p1 = new TPoint( xmax + deltaX, ymin - deltaY );
TPoint p2 = new TPoint( xmin - deltaX, ymin - deltaY );
org.poly2tri.triangulation.pointTPoint<init>

Popular methods of TPoint

    Popular in Java

    • Updating database using SQL prepared statement
    • scheduleAtFixedRate (ScheduledExecutorService)
    • getContentResolver (Context)
    • getSharedPreferences (Context)
    • VirtualMachine (com.sun.tools.attach)
      A Java virtual machine. A VirtualMachine represents a Java virtual machine to which this Java vir
    • Rectangle (java.awt)
      A Rectangle specifies an area in a coordinate space that is enclosed by the Rectangle object's top-
    • MessageDigest (java.security)
      Uses a one-way hash function to turn an arbitrary number of bytes into a fixed-length byte sequence.
    • Hashtable (java.util)
      A plug-in replacement for JDK1.5 java.util.Hashtable. This version is based on org.cliffc.high_scale
    • TreeSet (java.util)
      TreeSet is an implementation of SortedSet. All optional operations (adding and removing) are support
    • SAXParseException (org.xml.sax)
      Encapsulate an XML parse error or warning.> This module, both source code and documentation, is in t
    • 21 Best IntelliJ Plugins
    Tabnine Logo
    • Products

      Search for Java codeSearch for JavaScript code
    • IDE Plugins

      IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimAtomGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
    • Company

      About UsContact UsCareers
    • Resources

      FAQBlogTabnine AcademyStudentsTerms of usePrivacy policyJava Code IndexJavascript Code Index
    Get Tabnine for your IDE now