ivvaan / balaban-segments-intersectionsLinks
Automatically exported from code.google.com/p/balaban-segments-intersections
☆16Updated 11 months ago
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:
- 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
- A module to check if a polygon self-intersects☆30Updated 5 years ago
- stable polygon intersection☆33Updated 3 weeks ago
- A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.☆71Updated 8 months ago
- Polygon and line clipping and offsetting library☆23Updated 10 years ago
- Binary Space Partition Tree Based 2D Polygon Boolean Operation☆12Updated 2 years ago
- General Polygon Clipper, aka GPC, version 2.33☆93Updated 3 years ago
- dcel.js is lightweight JavaScript implementation of Doubly connected edge list.☆11Updated last year
- Use Freetype and font files to make signed distance field glyphs☆49Updated 3 years ago
- A header-only library that implements the Vatti clipping algorithm☆32Updated 2 years ago
- A Bounding Volume Hierarchy implementation using javascript☆51Updated 9 years ago
- Surface Simplification via Quadric Error Metrics☆80Updated 7 years ago
- RBush-3D — a high-performance JavaScript R-tree-based 3D spatial index for points and cuboids☆90Updated 10 months ago
- A series of examples written while learning about WebGPU☆52Updated 3 years ago
- Closed 3D Triangle Mesh Boolean Operation Library☆26Updated 3 years ago
- Computing oriented minimum bounding boxes using Rotating Calipers☆38Updated 7 years ago
- A simple algorithm for Boolean operations on polygons☆13Updated this week
- Loose Quadtree (Region Tree) simple C++11 implementation☆66Updated last year
- 2D Delaunay triangulation (dela) - super stable (bella!)☆239Updated last year
- Fast robust predicates for computational geometry in JavaScript☆315Updated last year
- Computational geometry algorithms in Java☆129Updated 9 years ago
- Automatically exported from code.google.com/p/osghimmel☆16Updated 10 years ago
- A canvas implementation of the Meijster algorithm to compute Euclidean, Manhattan, and Chessboard distances☆56Updated 14 years ago
- C++ port of https://github.com/mourner/flatbush☆19Updated 4 years ago
- tessellation of concave polygons with holes in Javascript☆38Updated 12 years ago
- Delaunay Triangulations / Voronoi Diagrams in C☆23Updated 9 years ago
- A basic geometry C++ library for 2D and 3D applications☆97Updated 7 months ago
- 3D polygonal mesh renderer with dynamic level-of-detail (LOD).☆67Updated 5 years ago
- A library for constraining triangulations from Delaunator☆69Updated last week
- Fast Hilbert Curve Generation, Sorting, and Range Queries☆16Updated 9 years ago