{"version":"1.0","type":"rich","title":"Splitting polygons using triangulation","description":"This example shows polygon geometries subdivided into smaller triangles until each triangle’s area falls below a specified threshold. The code triangulates input polygons using Shapely’s `constrained_delaunay_triangles`, then recursively splits oversized triangles along the midpoint of their longest edge via a deque-based queue. It handles invalid or non-planar geometries with `make_valid`, `force_2d`, and `buffer(0)`, and processes test polygons defined in WKT format. The output is a generator of Shapely `Polygon` objects.","provider_name":"VizHub AI Studio","provider_url":"https://next.vizhub.com","html":"<iframe src=\"https://next.vizhub.com/viz/gist-7882140e5f000d1a79edb65434a691d3?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"1\"></iframe>","width":960,"height":500,"cache_age":3600}