JSPM

Find the faces of a planar graph

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

Convert a planar graph to a collection of nest polylines

Constrained Delaunay Triangulation in 2D

Simplifies a planar graph

Merge non continuous geojson polygons into multiples concave polygons based on polygons distance.

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

Computes a boolean combination of two planar graphs

Convert a planar straight line graph into a polygon

Convert a polygon into a planar straight line graph

A script to convert Pakon F-135+ Planar RAW scans from TLXClientDemo into usable files via ImageMagick's Convert and NegFix8

crocker - a Crank-Rocker design and analysis library

Planar Network Ticket Wallet

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

Merge two (adjacent) simple polygons into one.

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

Draw a planar graph to an svg file

Trims a set of lines based on a planar graph

Trims a set of lines based on a planar graph

A wrapper object for 2d arrays that provides a plethora of useful methods.