{"version":"1.0","type":"rich","title":"Polygon clipping","description":"The first test of a (very naive) algorithm used to calculate the visible parts of the line segments of a polygon that is (partly) occluded by other polygons.\nThe algorithm doesn't work well with edge cases (overlapping lines or polygons that share one or more vertices). I tried to come up with a function that would give me a set of non-overlapping lines, so I can draw the result directly with my plotter.\n\n#polygons","author_name":"reinder","author_url":"https:\/\/turtletoy.net\/user\/reinder","provider_name":"Turtletoy","provider_url":"https:\/\/turtletoy.net\/","license":{"fullName":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International","shortName":"CC BY-NC-SA 4.0","url":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0\/"},"thumbnail_url":"https:\/\/turtletoy.net\/thumbnail\/348e597fd8.jpg","thumbnail_width":512,"thumbnail_height":512,"html":"<iframe src=\"https:\/\/turtletoy.net\/embed\/348e597fd8\" width=\"1025px\" height=\"554px\" style=\"max-width: 100%; border: 0\" sandbox=\"allow-scripts allow-top-navigation allow-top-navigation-by-user-activation allow-forms allow-popups allow-same-origin\"><\/iframe>","width":1025,"height":554}