mikolalysenko / robust-segment-intersectLinks
Exact predicate to test if two line segments intersect
☆10Updated 11 years ago
Alternatives and similar repositories for robust-segment-intersect
Users that are interested in robust-segment-intersect are comparing it to the libraries listed below
Sorting:
- Renders a simplicial complex to a list of polygons in SVG☆25Updated 11 years ago
- Draws static indexed geometry in WebGL☆13Updated 9 years ago
- ndarray operations☆67Updated 3 years ago
- Clean up messy planar straight line graphs☆47Updated 8 years ago
- Offset polygon☆17Updated last year
- Component-wise operations for ndarrays☆123Updated 5 years ago
- Extract a contour on a simplicial complex☆11Updated 3 years ago
- Reuse typed arrays☆76Updated 3 years ago
- Hierarchically snap round a set of 2d points for optimizing level of detail rendering in WebGL☆14Updated 6 years ago
- FFT for ndarrays☆49Updated 8 years ago
- A JavaScript implementation of the triangle tessellation algorithm from the OpenGL specification for tessellation shaders.☆15Updated 2 years ago
- A module to check if a polygon self-intersects☆30Updated 5 years ago
- ES module distribution for stdlib, a standard library for JavaScript and Node.js.☆13Updated 4 years ago
- A flexible wrapper for gl-vao and gl-buffer that you can use to set up renderable WebGL geometries from a variety of different formats.☆51Updated 6 years ago
- Compute a definite integral using Simpson's Rule with adaptive quadrature☆23Updated 8 years ago
- Generate a series of 2D contour meshes over a heightmap☆24Updated 9 years ago
- A collection of probability distribution functions☆41Updated last year
- A camera with input hooks for basic 3D projects☆35Updated 6 years ago
- Find zeros of a function using the Newton-Raphson method☆26Updated 5 years ago
- 1D interval tree☆72Updated 2 years ago
- ☆79Updated 6 years ago
- TypeScript implementation of a Hilbert Packed R-Tree without external dependencies☆28Updated last week
- Exact polygon boolean operations☆20Updated 10 years ago
- Computes normals for triangulated meshes☆18Updated 9 years ago
- A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.☆71Updated 7 months ago
- Fills an ndarray with a function☆21Updated 7 years ago
- Bulirsch-Stoer integration of systems of ordinary differential equations in JavaScript☆56Updated 2 years ago
- WebGL buffer wrapper☆24Updated 10 years ago
- Extracts a rectilinear polygon contour from a binary image☆25Updated 11 years ago
- manipulate polygons in 2d space☆135Updated 8 years ago