Package net.wigis.graph.dnv.utilities

Examples of net.wigis.graph.dnv.utilities.Vector2D.subtract()

706
707
708
709
710
711
712
713
714
715
716
    Vector2D zeroPixels = ImageRenderer.transformScreenToWorld( 0, 0, minX, maxX, minY, maxY, globalMinX, globalMaxX, globalMinY, globalMaxY, width, height );

    Vector2D fivePixels = ImageRenderer.transformScreenToWorld( 5, 5, minX, maxX, minY, maxY, globalMinX, globalMaxX, globalMinY, globalMaxY, width, height );

    fivePixels.subtract( zeroPixels );

    Vector2D movement = new Vector2D( 0, 0 );
    if( selectedNode == null && sameNode )
    {
      selectedNode = pb.getSelectedNode();
View Full Code Here
306
307
308
309
310
311
312
313
314
315
316
        for( DNVNode u : potentialNodes )
        {
          if( u != v )
          {
            difference.set( v.getPosition() );
            difference.subtract( u.getPosition() );
            length = difference.length();
            if( length == 0 )
            {
              difference.set( (float)Math.random() - 0.5f, (float)Math.random() - 0.5f );
              length = difference.length();
View Full Code Here
327
328
329
330
331
332
333
334
335
336
337
      // attractive forces
      for( DNVEdge e : graph.getEdges( level ) )
      {
        difference.set( e.getFrom().getPosition() );
        difference.subtract( e.getTo().getPosition() );
        length = difference.length();
        difference.normalize();
        difference.dotProduct( attract( length, k ) );
        e.getFrom().getForce().subtract( difference );
        e.getTo().getForce().add( difference );
View Full Code Here
129
130
131
132
133
134
135
136
137
138
139
      for( DNVNode u : potentialNodes )
      {
        if( u != v )
        {
          difference.set( v.getPosition() );
          difference.subtract( u.getPosition() );
          length = difference.length();
          // If two nodes are in exact same position
          // then we need to do something to move them apart.
          // Give them a small repelling force in random direction.
          if( length == 0 )
View Full Code Here
165
166
167
168
169
170
171
172
173
174
175
    // attractive forces
    for( DNVEdge e : edges )
    {
      difference.set( e.getFrom().getPosition() );
      difference.subtract( e.getTo().getPosition() );
      length = difference.length();
      if( useRestingDistance )
      {
        length = length - e.getRestingDistance();
        length = length * e.getK();
 
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
      for( DNVNode u : potentialNodes )
      {
        if( u != v )
        {
          difference.set( v.getPosition() );
          difference.subtract( u.getPosition() );
          length = difference.length();
          // If two nodes are in exact same position
          // then we need to do something to move them apart.
          // Give them a small repelling force in random direction.
          if( length == 0 )
View Full Code Here
138
139
140
141
142
143
144
145
146
147
148
    // attractive forces
    for( DNVEdge e : edges )
    {
      difference.set( e.getFrom().getPosition() );
      difference.subtract( e.getTo().getPosition() );
      length = difference.length();
      difference.normalize();
      difference.dotProduct( attract( length, k ) );
      e.getFrom().getForce().subtract( difference );
      e.getTo().getForce().add( difference );
View Full Code Here
170
171
172
173
174
175
176
177
178
179
180
  private static void forceToCircle( List<DNVNode> nodes, Vector2D center, int radius )
  {
    for( DNVNode v : nodes )
    {
      Vector2D newPos = new Vector2D( v.getPosition() );
      newPos.subtract( center );
      newPos.normalize();
      newPos.dotProduct( radius );
      newPos.add( center );
      v.setPosition( newPos );
    }
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.