Package org.apache.commons.math3.geometry.spherical.oned

Examples of org.apache.commons.math3.geometry.spherical.oned.ArcsSet$SubArcsIterator

236
237
238
239
240
241
242
        return new Arc(alpha - halfPi, alpha + halfPi, tolerance);
    }

    /** {@inheritDoc} */
    public SubCircle wholeHyperplane() {
        return new SubCircle(this, new ArcsSet(tolerance));
    }
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
93
            return new SplitSubHyperplane<Sphere2D>(this, null);
        } else {
            // the two circles intersect each other
            final Arc    arc          = thisCircle.getInsideArc(otherCircle);
            final ArcsSet.Split split = ((ArcsSet) getRemainingRegion()).split(arc);
            final ArcsSet plus        = split.getPlus();
            final ArcsSet minus       = split.getMinus();
            return new SplitSubHyperplane<Sphere2D>(plus  == null ? null : new SubCircle(thisCircle.copySelf(), plus),
                                                    minus == null ? null : new SubCircle(thisCircle.copySelf(), minus));
        }

    }
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
        Circle xzPlane = new Circle(Vector3D.PLUS_J, 1.0e-10);

        SubCircle sc1 = create(Vector3D.PLUS_K, Vector3D.PLUS_I, Vector3D.PLUS_J, 1.0e-10, 1.0, 3.0, 5.0, 6.0);
        SplitSubHyperplane<Sphere2D> split1 = sc1.split(xzPlane);
        ArcsSet plus1  = (ArcsSet) ((SubCircle) split1.getPlus()).getRemainingRegion();
        ArcsSet minus1 = (ArcsSet) ((SubCircle) split1.getMinus()).getRemainingRegion();
        Assert.assertEquals(1, plus1.asList().size());
        Assert.assertEquals(5.0, plus1.asList().get(0).getInf(), 1.0e-10);
        Assert.assertEquals(6.0, plus1.asList().get(0).getSup(), 1.0e-10);
        Assert.assertEquals(1, minus1.asList().size());
        Assert.assertEquals(1.0, minus1.asList().get(0).getInf(), 1.0e-10);
        Assert.assertEquals(3.0, minus1.asList().get(0).getSup(), 1.0e-10);

        SubCircle sc2 = create(Vector3D.PLUS_K, Vector3D.PLUS_I, Vector3D.PLUS_J, 1.0e-10, 1.0, 3.0);
        SplitSubHyperplane<Sphere2D> split2 = sc2.split(xzPlane);
        Assert.assertNull(split2.getPlus());
        ArcsSet minus2 = (ArcsSet) ((SubCircle) split2.getMinus()).getRemainingRegion();
        Assert.assertEquals(1, minus2.asList().size());
        Assert.assertEquals(1.0, minus2.asList().get(0).getInf(), 1.0e-10);
        Assert.assertEquals(3.0, minus2.asList().get(0).getSup(), 1.0e-10);

        SubCircle sc3 = create(Vector3D.PLUS_K, Vector3D.PLUS_I, Vector3D.PLUS_J, 1.0e-10, 5.0, 6.0);
        SplitSubHyperplane<Sphere2D> split3 = sc3.split(xzPlane);
        ArcsSet plus3  = (ArcsSet) ((SubCircle) split3.getPlus()).getRemainingRegion();
        Assert.assertEquals(1, plus3.asList().size());
        Assert.assertEquals(5.0, plus3.asList().get(0).getInf(), 1.0e-10);
        Assert.assertEquals(6.0, plus3.asList().get(0).getSup(), 1.0e-10);
        Assert.assertNull(split3.getMinus());

        SubCircle sc4 = create(Vector3D.PLUS_J, Vector3D.PLUS_K, Vector3D.PLUS_I, 1.0e-10, 5.0, 6.0);
        SplitSubHyperplane<Sphere2D> split4 = sc4.split(xzPlane);
        Assert.assertEquals(Side.HYPER, sc4.side(xzPlane));
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
                             double tolerance, double ... limits) {
        RegionFactory<Sphere1D> factory = new RegionFactory<Sphere1D>();
        Circle circle = new Circle(pole, tolerance);
        Circle phased =
                (Circle) Circle.getTransform(new Rotation(circle.getXAxis(), circle.getYAxis(), x, y)).apply(circle);
        ArcsSet set = (ArcsSet) factory.getComplement(new ArcsSet(tolerance));
        for (int i = 0; i < limits.length; i += 2) {
            set = (ArcsSet) factory.union(set, new ArcsSet(limits[i], limits[i + 1], tolerance));
        }
        return new SubCircle(phased, set);
    }
View Full Code Here
512
513
514
515
516
517
518
519
520
521
522
                             double tolerance, double ... limits) {
        RegionFactory<Sphere1D> factory = new RegionFactory<Sphere1D>();
        Circle circle = new Circle(pole, tolerance);
        Circle phased =
                (Circle) Circle.getTransform(new Rotation(circle.getXAxis(), circle.getYAxis(), x, y)).apply(circle);
        ArcsSet set = (ArcsSet) factory.getComplement(new ArcsSet(tolerance));
        for (int i = 0; i < limits.length; i += 2) {
            set = (ArcsSet) factory.union(set, new ArcsSet(limits[i], limits[i + 1], tolerance));
        }
        return new SubCircle(phased, set);
    }
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
     
      List<SiteWithPolynomial> nearestSites =
          nearestSiteMap.get(site);
     
      RealVector vector = new ArrayRealVector(SITES_FOR_APPROX);
      RealMatrix matrix = new Array2DRowRealMatrix(
          SITES_FOR_APPROX, DefaultPolynomial.NUM_COEFFS);
     
      for (int row = 0; row < SITES_FOR_APPROX; row++) {
        SiteWithPolynomial nearSite = nearestSites.get(row);
        DefaultPolynomial.populateMatrix(matrix, row, nearSite.pos.x, nearSite.pos.z);
View Full Code Here
288
289
290
291
292
293
294
295
296
        }

        // solve the rectangular system in the least square sense
        // to get the best estimate of the Nordsieck vector [s2 ... sk]
        QRDecomposition decomposition;
        decomposition = new QRDecomposition(new Array2DRowRealMatrix(a, false));
        RealMatrix x = decomposition.getSolver().solve(new Array2DRowRealMatrix(b, false));
        return new Array2DRowRealMatrix(x.getData(), false);
    }
View Full Code Here
270
271
272
273
274
275
276
277
278
279
280
            // update Nordsieck vector
            final double[] predictedScaled = new double[y0.length];
            for (int j = 0; j < y0.length; ++j) {
                predictedScaled[j] = stepSize * yDot[j];
            }
            final Array2DRowRealMatrix nordsieckTmp = updateHighOrderDerivativesPhase1(nordsieck);
            updateHighOrderDerivativesPhase2(scaled, predictedScaled, nordsieckTmp);
            interpolator.reinitialize(stepEnd, stepSize, predictedScaled, nordsieckTmp);

            // discrete events handling
            interpolator.storeTime(stepEnd);
View Full Code Here
71
72
73
74
75
76
77
78
     * @param residuals Residuals.
     * @return the cost.
     * @see #computeResiduals(double[])
     */
    protected double computeCost(double[] residuals) {
        final ArrayRealVector r = new ArrayRealVector(residuals);
        return FastMath.sqrt(r.dotProduct(getWeight().operate(r)));
    }
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
    for (SiteWithPolynomial site : sites) {
     
      List<SiteWithPolynomial> nearestSites =
          nearestSiteMap.get(site);
     
      RealVector vector = new ArrayRealVector(SITES_FOR_APPROX);
      RealMatrix matrix = new Array2DRowRealMatrix(
          SITES_FOR_APPROX, DefaultPolynomial.NUM_COEFFS);
     
      for (int row = 0; row < SITES_FOR_APPROX; row++) {
        SiteWithPolynomial nearSite = nearestSites.get(row);
        DefaultPolynomial.populateMatrix(matrix, row, nearSite.pos.x, nearSite.pos.z);
        vector.setEntry(row, nearSite.pos.y);
      }
     
      QRDecomposition qr = new QRDecomposition(matrix);
      RealVector solution = qr.getSolver().solve(vector);
       
View Full Code Here
TOP

Related Classes of org.apache.commons.math3.geometry.spherical.oned.ArcsSet$SubArcsIterator

  • org.apache.commons.math3.analysis.differentiation.DerivativeStructure
  • org.apache.commons.math3.analysis.differentiation.MultivariateDifferentiableVectorFunction
  • org.apache.commons.math3.analysis.function.HarmonicOscillator
  • org.apache.commons.math3.analysis.function.Sin
  • org.apache.commons.math3.analysis.function.Sinc
  • org.apache.commons.math3.analysis.MultivariateFunction
  • org.apache.commons.math3.analysis.QuinticFunction
  • org.apache.commons.math3.analysis.solvers.BrentSolver
  • org.apache.commons.math3.analysis.UnivariateFunction
  • org.apache.commons.math3.complex.Complex
    • 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.