Documentation of 'math.geom2d.circulinear.CirculinearCurves2D' Java class
CirculinearCurves2D
math.geom2d.circulinear

Class CirculinearCurves2D



  • public class CirculinearCurves2D
    extends java.lang.Object
    Some utilities for working with circulinear curves.
    • Constructor Detail

      • CirculinearCurves2D

        public CirculinearCurves2D()
    • Method Detail

      • convert

        public static CirculinearCurve2D convert(Curve2D curve)
        Converts a curve to a circulinear curve, by concatenating all elements of the curve to the appropriate circulinear curve type. If the curve contains one or more non-circulinear smooth curve, a NonCirculinearClassException is thrown.
      • findSelfIntersections

        public static java.util.Collection<Point2D> findSelfIntersections(CirculinearCurve2D curve)
        Computes intersection point of a single curve, by iterating on pair of Circulinear elements composing the curve.
        Returns:
        the set of self-intersection points
      • findIntersections

        public static java.util.Collection<Point2D> findIntersections(CirculinearCurve2D curve1,
                                                                      CirculinearCurve2D curve2)
        Compute the set of intersection points between the two curves.
        Returns:
        a collection of intersection points
      • locateIntersections

        public static double[][] locateIntersections(CirculinearCurve2D curve1,
                                                     CirculinearCurve2D curve2)
        Locate intersection points of two curves. The result is a N-by-2 array of double, where N is the number of intersections. For each row, the first element is the position on the first curve, and the second element is the position on the second curve.
      • splitContinuousCurve

        public static java.util.Collection<CirculinearContinuousCurve2D> splitContinuousCurve(CirculinearContinuousCurve2D curve)
        Split a continuous curve which self-intersects into a set of continuous circulinear curves which do not self-intersect.
        Parameters:
        curve - the curve to split
        Returns:
        a set of non-self-intersecting continuous curves
      • splitIntersectingContours

        public static java.util.Collection<CirculinearContour2D> splitIntersectingContours(java.util.Collection<? extends CirculinearContour2D> curves)
        Split a collection of contours which possibly intersect each other to a set of contours which do not intersect each others. Each contour is assumed not to self-intersect.
      • getDistanceCurvePoints

        public static double getDistanceCurvePoints(CirculinearCurve2D curve,
                                                    java.util.Collection<? extends Point2D> points)

DMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.