File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change 1010- need to know what kind of curves should be used for
1111 curve fit--curve or qcurve
1212- false curves and duplicate points need to be filtered early on
13-
1413notes:
1514- the flattened segments *must* be cyclical.
1615 if they aren't, matching is almost impossible.
17-
18-
1916optimization ideas:
2017- the flattening of the output segment in the full contour
2118 matching is probably expensive.
3936 known points are:
4037 input oncurve points
4138 if nothing found intersection points (only use this is in the final curve fitting stage)
42-
4339test cases:
4440- untouched contour: make clockwise and counter-clockwise tests
4541 of the same contour
@@ -242,7 +238,6 @@ def split(self, tValues):
242238 def tValueForPoint (self , point ):
243239 """
244240 get a t values for a given point
245-
246241 required:
247242 the point must be a point on the curve.
248243 in an overlap cause the point will be an intersection points wich is alwasy a point on the curve
@@ -1145,7 +1140,6 @@ def _flattenSegment(segment, approximateSegmentLength=_approximateSegmentLength)
11451140 The first and last points in the segment must be
11461141 on curves. The returned list of points will not
11471142 include the first on curve point.
1148-
11491143 false curves (where the off curves are not any
11501144 different from the on curves) must not be sent here.
11511145 duplicate points must not be sent here.
You can’t perform that action at this time.
0 commit comments