cdt2d
Constrained Delaunay Triangulation in 2D
Constrained Delaunay Triangulation in 2D
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
Find the faces of a planar graph
Simplifies a planar graph
Convert a polygon into a planar straight line graph
Computes a boolean combination of two planar graphs
A script to convert Pakon F-135+ Planar RAW scans from TLXClientDemo into usable files via ImageMagick's Convert and NegFix8
Merge two (adjacent) simple polygons into one.
Trims a set of lines based on a planar graph
Convert a planar straight line graph into a polygon
crocker - a Crank-Rocker design and analysis library
Planar Network Ticket Wallet
Draw a planar graph to an svg file
Planar Network Ticket Wallet
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.
Merge non continuous geojson polygons into multiples concave polygons based on polygons distance.
A wrapper object for 2d arrays that provides a plethora of useful methods.
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