Simplifies a planar graph

Convert a planar graph to a collection of nest polylines

Polygonizes a set of lines that represents edges in a planar graph.

Find the faces of a planar graph

Minimal cycle basis for a planar graph

Build a deterministic, low-degree, approximately planar graph from 2D points.

Draw a planar graph to an svg file

Render a string to a vectorized cell complex

Trims a set of lines based on a planar graph

Deterministic SVG avatars via recursive planar graph subdivision — hue, variance, density, and border width produce unique colored geometry

Remove self intersections, t-junctions and duplicate edges/vertices from a planar straight line graph

Trims a set of lines based on a planar graph

Given a graph with a graph with a non planar embedding, make changes to this graph so that it becomes planar.

Calculates the distance between a given point and the nearest point on a line.

A Cycle.js component for managing planar graphs and interfacing them with the viewport.js API

Given a planar, undirected, graph enumerate all of the faces of the graph. Can also be described as finding all of the polygons within the graph, or the minimum cycle basis

An extended WASM wrapper of the PolySeg VTK/C++ implementation

Simple dependency graph.

Get the graph of dependents in a monorepo

Javascript implementation of GEOS's Polygonize function