Question

我有一个图书馆,利用中点近线,定期收集比照路数(构成许多比方点的复杂路程)。

我可以毫不怀疑地提出这些建议,但我需要为先进的地貌作业提供更多支持: 曲线最接近点,交叉点,数字包含点,更重要的是,path组合:差异、交叉点、排他性、联盟, ......

是否有很好的来源来做到这一点?

增编

Answer 1

我不得不在 cur或封闭的道路上实施其中一些行动。大部分锅炉.到底线和多管。几个有用的概念:

The control points form a convex hull around the Bezier path, which is useful to short circuit intersection-related operations.
Your curve subdivision should be adaptive, stopping when the next subdivision won t be a significant difference, which means each "half" may divide to a different depth.
You can subdivide a curve at any point, not just the midpoint, which is useful for creating a Bezier subcurve ending at a found interestion point.

任意分区的示范守则:

 static Point2D.Double[][] splitBezier(Point2D.Double[] p) {
     return splitBezier(p, 0.5);
 }

 static Point2D.Double[][] splitBezier(Point2D.Double[] p, double t) {
    Point2D.Double[][] parts = new Point2D.Double[2][4];
    Point2D.Double ab = interpolate(t, p[0], p[1]);
    Point2D.Double bc = interpolate(t, p[1], p[2]);
    Point2D.Double cd = interpolate(t, p[2], p[3]);
    Point2D.Double abc = interpolate(t, ab, bc);
    Point2D.Double bcd = interpolate(t, bc, cd);
    Point2D.Double abcd = interpolate(t, abc, bcd);
    parts[0][0] = p[0];
    parts[0][1] = ab;
    parts[0][2] = abc;
    parts[0][3] = abcd;
    parts[1][0] = abcd;
    parts[1][2] = bcd;
    parts[1][2] = cd;
    parts[1][3] = p[3];
    return parts;
 }

 static Point2D.Double interpolate(double t, Point2D.Double a, Point2D.Double b) {
    return new Point2D.Double((1 - t) * a.getX() + t * b.getX(),
                              (1 - t) * a.getY() + t * b.getY());
 }

一些有用的网站:

友情链接