Splitting polygons using triangulation

100%

Splitting polygons using triangulation

✓ Published0🌍 Public

Last edited Oct 7, 2025

Created on Oct 7, 2025

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.

AI-generated description

Similar vizzes

Loading thumbnail…

Gist d645d3d5abe4993556a6a2132722919a

This example demonstrates a mesh-subdivision algorithm that transforms a Conway polyhedron by offsetting its vertices and adding new faces at edge midpoints. It shows how the original geometry is refined into a smoother, more complex structure while preserving the polyhedron’s topological connectivity. The code uses custom `ConwayPoly`, `Face`, `Halfedge`, and `Vector3` classes, along with LINQ operations like `Select` and `Find`, to manipulate vertex positions and face indices. The rendering approach relies on the polyhedron’s internal data structures, with the offset parameter controlling the inflation of each vertex along its normal.

Aandybak

60% match

Loading thumbnail…

naive triangulation

This example demonstrates a naive ear-clipping triangulation of a simple polygon, animated to show the algorithm's worst-case quadratic performance. The visualization renders the polygon and its triangles using SVG, with each newly clipped ear highlighted as the algorithm steps through the shape. The code, built with D3 v4 and jetpack, animates the process, making it easy to see how the polygon is progressively decomposed into triangles, even in cases where the ear-clipping approach degrades quadratically.

11wheel

57% match

Loading thumbnail…

Polygons

This interactive visualization explores polygon triangulations through codewords, combinatorial representations of how diagonals partition an N-gon. Users can select different N values and codewords from dropdown menus to see the corresponding interior edges drawn as animated paths with staggered stroke-dashoffset transitions. The application uses D3 v7 selections and transitions to animate points, edges, and labels, while codeword generation and geometry calculations are handled by custom JavaScript modules. Colors for interior edges are mapped using `d3.interpolateViridis` based on vertex positions, with buttons to restart or start the animation sequence.

TTrio-

56% match

Loading thumbnail…

Fork of Polygons2

This visualization explores the combinatorial structure of polygon dissections by displaying an N-polygon with its interior edges determined by a user-selected codeword. The code uses D3 v7 to render an SVG, with a menu that lets viewers switch between different codewords, dynamically redrawing the polygon's interior line segments based on the selected combinatorial representation. A subtle animation transitions the polygon's points into place on initial load.

TTrio-

55% match

Loading thumbnail…

Alpha-Shapes

This example visualizes the alpha-shape boundary of a set of 2D points, highlighting the concave hull that encloses the data. It uses D3.js to compute a Delaunay triangulation via `d3.geom.delaunay`, filters triangles whose edges exceed a squared alpha threshold, and then traces the outer edges with a custom `boundary` function. The points are offset horizontally, and the resulting polygon is rendered in yellow SVG paths over a blue background, while the raw vertices remain hidden. The code relies on D3 v5 and an older D3 geometry module for triangulation.

EEdward-Elric233

54% match

Loading thumbnail…

Fork of Polygons

This example visualizes all valid codewords for an N-polygon, with each codeword represented by a set of interior edges connecting polygon vertices. Users select a codeword from a dropdown menu to see its corresponding geometric interpretation. The visualization animates the drawing of interior edges using stroke-dashoffset transitions, while color mapping interpolates between purple and orange. Built with D3 v7, the code leverages `d3.line`, `d3.transition`, and custom geometry functions to generate polygon points, edges, and codeword-derived diagonals.

TTrio-

53% match

Loading thumbnail…

Multiple polygons with d3.js

Three polygons render in a fixed 960 by 700 SVG canvas, with each polygon’s vertices scaled from x,y coordinates in JSON data to pixel positions using `d3.scale.linear`. The example loads `polygons.json` via `d3.json`, binds the polygon array to SVG elements, and sets each `polygon`’s `points` attribute by mapping coordinate pairs through the scales. All polygons share a black stroke with a width of two pixels. The code uses D3 v3’s selection and data-join patterns, with no interactivity or animation present.

SSokrates86

53% match

Loading thumbnail…

Alpha-Shape Bounded Voronoi Tessellation

An interactive Voronoi tessellation divides a plane into cells around 100 randomly placed sites, with the site distribution forming two distinct clusters near the left and right edges. The visualization highlights the two clusters’ boundaries using a computed alpha shape, whose convex hull is expanded and then filled with additional artificial sites to constrain the tessellation. Built with d3.v4, it uses `d3.voronoi`, `d3.polygonHull`, and `d3.curveCatmullRomClosed` to calculate and render the polygons and hull path in SVG.

PPhilippe Rivière

53% match