![]() For Point 5 there are existing libraries to determine intersection points. ![]() If its length is above a "length" threshold, the segments could be said to overlap.įor Point 1, I can't name a library, but same as Point 4 it is what every vector renderer essentially does, so that should be achievable with existing resources. Measure the size (viewBox) of the resulting intersection pieces. (Beware: with Inkscape, that is a destructive process, so make copies.) Give all of these paths a stroke width that is double the "overlap" threshold.Ĭonvert the contours of the strokes to paths.įor all pairs of paths, cut out the intersection. Maybe that could serve as a template for a doable algorithm:Ĭonvert all grafical primitives to paths.ĭisassemble all paths so that each individual segments is a separate path. So here is something I could do in the Inkscape GUI. ![]() You did not say what should happen when you find that path segments overlap only for part of their extent. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |