There was an error while loading. Please reload this page.
Document voronoi, and correct the triangualize page The triangualize page described an operator that never existed: it claimed a sweep-line implementation, a result of one triangle fan per input point, and "since version 5.0". The operator was in fact unimplemented until 20.12 and now returns the triangulation as an edge network -- a unit with one row per edge and F1/F2 relating to the point domain -- so syntax, definition, example and performance are rewritten around what it does. The edge-count identity 3m-3-h and its bounds are documented, since that is what makes the result size predictable. New voronoi page for the dual operator: one Thiessen cell per point, clipped to the range of the unit given as second argument. The tiling property, the treatment of null and coinciding points, and why the cells are built by half-plane clipping rather than from circumcentres are all spelled out, the last because it is what makes collinear input work. Both examples are the ones actually run against 20.12, including the note that the diagonal of a cocircular square is an arbitrary but deterministic choice while the edge count is not. Also corrects bp_buffer_multi_point: its buffer_distance argument is Float64, not an integer value type. Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>