mikolalysenko
@mikolalysenko
30
Published Tools
0
Total Stars
0
Weekly Downloads
Published Tools
30 Skillsacross 3 categoriesgl-state
mikolalysenko
Saves WebGL context state
vectorize-text
mikolalysenko
Render a string to a vectorized cell complex
superscript-text
mikolalysenko
Converts text to superscript unicode
simplicial-complex
mikolalysenko
Topological indexing for simplicial complexes
two-sum
mikolalysenko
Computes a non-overlapping sequence representing the sum of two floating point numbers.
save-pixels
mikolalysenko
Saves an ndarray as an image to a file
get-pixels
mikolalysenko
Reads the pixels of an image as an ndarray
ppm
mikolalysenko
A simple streaming ascii PPM image parser/writer
ndarray-warp
mikolalysenko
ndarray image warping
ndarray-extract-contour
mikolalysenko
Generic contour extraction library for surface nets/dual contouring
functional-red-black-tree
mikolalysenko
A fully persistent balanced binary search tree
marching-simplex-table
mikolalysenko
Construct the table entries for the marching simplex method
conway-hart
mikolalysenko
CommonJS port of George Hart's polyhedral notation library
filtered-vector
mikolalysenko
Filter an input vector valued curve
rat-vec
mikolalysenko
Exact rational vector arithmetic
exact-segment-intersect
mikolalysenko
Exactly constructs the intersection of two line segments
planar-dual
mikolalysenko
Find the faces of a planar graph
binary-search-bounds
mikolalysenko
Better binary searching
3d-view
mikolalysenko
3D camera view controller
mouse-change
mikolalysenko
Mouse state change listener
permutation-rank
mikolalysenko
Ranks and unranks permutations
mouse-event
mikolalysenko
Cross browser mouse event property access
mouse-wheel
mikolalysenko
Consistent cross browser mouse wheel movement
latex
mikolalysenko
A simple wrapper for LaTeX in node.js
simplify-planar-graph
mikolalysenko
Simplifies a planar graph
planar-graph-to-polyline
mikolalysenko
Convert a planar graph to a collection of nest polylines
clean-pslg
mikolalysenko
Remove self intersections, t-junctions and duplicate edges/vertices from a planar straight line graph
strongly-connected-components
mikolalysenko
Computes strongly connected components of a directed graph
union-find
mikolalysenko
A union-find data structure for maintaining disjoint sets.
edges-to-adjacency-list
mikolalysenko
Convert a list of edges to an adjacency list