ivvaan / balaban-segments-intersectionsLinks
Automatically exported from code.google.com/p/balaban-segments-intersections
☆15Updated last year
Alternatives and similar repositories for balaban-segments-intersections
Users that are interested in balaban-segments-intersections are comparing it to the libraries listed below
Sorting:
- Binary Space Partition Tree Based 2D Polygon Boolean Operation☆12Updated 2 years ago
- Polygon and line clipping and offsetting library☆23Updated 10 years ago
- Mirrored implementations of polygon clipping/CSG/operations algorithm, in C (original, by Martínez et al) and ActionScript3 (port, by Mah…☆47Updated 8 years ago
- Fast Hilbert Curves☆78Updated 9 years ago
- stable polygon intersection☆33Updated 3 months ago
- Use Freetype and font files to make signed distance field glyphs☆50Updated 3 years ago
- Computing oriented minimum bounding boxes using Rotating Calipers☆39Updated 7 years ago
- A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.☆73Updated 10 months ago
- General Polygon Clipper, aka GPC, version 2.33☆94Updated 3 years ago
- 2D Delaunay triangulation (dela) - super stable (bella!)☆243Updated last year
- C++ port of https://github.com/mourner/flatbush☆19Updated 4 years ago
- RBush-3D — a high-performance JavaScript R-tree-based 3D spatial index for points and cuboids☆92Updated last year
- A module to check if a polygon self-intersects☆30Updated 5 years ago
- A general library for geometry operations of union, intersections, difference, and xor☆184Updated last year
- Parallel Delaunay and Voronoi Tessellation and Density Estimation☆29Updated 3 years ago
- Surface Simplification via Quadric Error Metrics☆81Updated 7 years ago
- A simple algorithm for Boolean operations on polygons☆13Updated last month
- Sample simple arcball trackball for OpenGL 4 in C++☆33Updated 8 years ago
- Tutorial on robust arithmetic in JavaScript☆209Updated 10 years ago
- A Bounding Volume Hierarchy implementation using javascript☆52Updated 10 years ago
- dcel.js is lightweight JavaScript implementation of Doubly connected edge list.☆11Updated last year
- A library for constraining triangulations from Delaunator☆71Updated 2 months ago
- Templated hierarchical spatial trees designed for high-peformance.☆131Updated last year
- A canvas implementation of the Meijster algorithm to compute Euclidean, Manhattan, and Chessboard distances☆56Updated 14 years ago
- tessellation of concave polygons with holes in Javascript☆38Updated 12 years ago
- weighted blended order-independent transparency using Qt4.8 with OpenGL 2.1 or above☆11Updated 3 years ago
- Single header implementation of "A linear-time component-labeling algorithm using contour tracing technique" by Fu Chang, Chun-Jen Chen,…☆56Updated last month
- A header-only library that implements the Vatti clipping algorithm☆34Updated 2 years ago
- Using clipper and poly2tri together for robust triangulation☆92Updated 10 years ago
- A fast geospatial static point clustering library for C++14☆38Updated 3 years ago