CPC G06T 11/206 (2013.01) [G06T 11/203 (2013.01)] | 20 Claims |
1. A computer-implemented method comprising:
receiving an input exemplar which represents a repetitive pattern as a plurality of vector curves;
generating an input graph representation of the input exemplar which represents a geometry and a topology of the input exemplar, wherein the topology indicates a connection between each point of a plurality of points on the plurality of vector curves using one or more tangents associated with each point, wherein the each point is associated with a number of tangents corresponding to a number of edges;
classifying the each point as being on a segment or being on an intersection based on a collinearity between the each point and the one or more tangents associated with the each point;
synthesizing an output graph based on the input graph representation and a cost, wherein synthesizing the output graph includes initializing a plurality of output points and identifying a match between the plurality of points on the plurality of vector curves and the plurality of output points and identifying an outlier between the plurality of points on the plurality of vector curves and the plurality of output points, wherein the outlier is assigned the cost; and
reconstructing output vector curves from the output graph and the classification of the each point.
|