Clean up messy planar straight line graphs
JavaScript
48
8
MIT License
Clean-pslg is a JavaScript library for resolving self-intersections, t-junctions, and removing duplicate vertices and edges from planar straight line graphs using iterated snap rounding. It is designed for developers working with computational geometry, particularly those needing to clean up graph data before triangulation or other geometric operations.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of mikolalysenko/clean-pslg
A big integer rational number
Any dimensional box intersection
Find the floating point number immediately after any given number
Exact rational vector arithmetic
Exact arithmetic test for line segment intersection
A union-find data structure for maintaining disjoint sets.
Removes duplicates from a sorted array in place
Mouse state change listener
Small module for fitting a canvas element within the bounds of its parent.
Exactly computes the orientation of a tuple of points
tap-producing test harness for node and browsers
2d line segment
manipulate vectors in 2d
Support the repos that depend on this repository
Top contributors
mikolalysenko
19 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet