Created
December 10, 2016 04:07
-
-
Save mathandy/78a0e52da43f8990545389998389e9ba to your computer and use it in GitHub Desktop.
An example of how to determine if an SVG Path is contained in another SVG Path in Python.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
""" | |
An example of how to determine if an svg path is contained in another | |
svg path in Python. | |
Note: for discontinuous paths you can use the svgpathtools | |
Path.continuous_subpaths() method to split a paths into a list of its | |
continuous subpaths. | |
""" | |
from svgpathtools import * | |
def path1_is_contained_in_path2(path1, path2): | |
assert path2.isclosed() # This question isn't well-defined otherwise | |
if path2.intersect(path1): | |
return False | |
# find a point that's definitely outside path2 | |
xmin, xmax, ymin, ymax = path2.bbox() | |
B = (xmin + 1) + 1j*(ymax + 1) | |
A = path1.start # pick an arbitrary point in path1 | |
AB_line = Path(Line(A, B)) | |
number_of_intersections = len(AB_line.intersect(path2)) | |
if number_of_intersections % 2: # if number of intersections is odd | |
return True | |
else: | |
return False | |
# Test examples | |
closed_path = Path(Line(0,5), Line(5,5+5j), Line(5+5j, 0)) | |
path_that_is_contained = Path(Line(1+1j, 2+2j)) | |
print(path1_is_contained_in_path2(path_that_is_contained, closed_path)) | |
path_thats_not_contained = Path(Line(10+10j, 20+20j)) | |
print(path1_is_contained_in_path2(path_thats_not_contained, closed_path)) | |
path_that_intersects = Path(Line(2+1j, 10+10j)) | |
print(path1_is_contained_in_path2(path_that_intersects, closed_path)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment