Displaying 1 to 20 from 38 results

GeometricIntersection

  •    DotNet

GeometricIntersection is an XNA library for testing for intersection between geometric shapes. It supports 2D intersection tests between circles, oriented rectangles, and polygons and 3D intersection tests between spheres, oriented boxes, cylinders, and capsules.

TurboPFor - Fastest Integer Compression

  •    C

Generate and test (zipfian) skewed distribution (100.000.000 integers, Block size=128/256) Note: Unlike general purpose compression, a small fixed size (ex. 128 integers) is in general used in "integer compression". Large blocks involved, while processing queries (inverted index, search engines, databases, graphs, in memory computing,...) need to be entirely decoded. (*) codecs inefficient for small block sizes are tested with 64Ki integers/block.

SIMDCompressionAndIntersection - A C++ library to compress and intersect sorted lists of integers using SIMD instructions

  •    C++

As the name suggests, this is a C/C++ library for fast compression and intersection of lists of sorted integers using SIMD instructions. The library focuses on innovative techniques and very fast schemes, with particular attention to differential coding. It introduces new SIMD intersections schemes such as SIMD Galloping.This library can decode at least 4 billions of compressed integers per second on most desktop or laptop processors. That is, it can decompress data at a rate of 15 GB/s. This is significantly faster than generic codecs like gzip, LZO, Snappy or LZ4.




camera-picking-ray - creates a picking ray for a 2D/3D camera

  •    Javascript

Creates a picking ray for a camera. Commonly used for mouse interaction in 2D and 3D games.The camera is assumed to have a projection and view matrix, which can be combined and inverted to form invProjView.

perspective-camera - a high-level 3D perspective camera

  •    Javascript

A high-level 3D perspective camera with a familiar and convenient interface, built from modular pieces.See demo/canvas.js for a full example, using Canvas2D.

ray-3d - a high-level ray picking helper for 3D intersection

  •    Javascript

A high-level ray picking helper for 3D intersection, built from modular pieces.Creates a new Ray with optional origin and direction, both arrays in the form [x, y, z].


ray-quadtree - ray - quadtree intersection + traversal for 2d "voxels"

  •    Javascript

A 2d implementation of the octree traversal algorithm described in An Efficient Parametric Algorithm for Octree Traversal.

polyclip - Martinez polygon boolean operations (a work in progress)

  •    HTML

Crazy fast polygon boolean operations in JS using Martinez algorithm. A work in progress.

ray-plane-intersection - whether a picking ray intersects with a plane

  •    Javascript

Whether a 3D picking ray intersects with a plane. The plane is defined as having a normal [x, y, z] and distance.PRs welcome.

wagyu - A general library for geometry operations of union, intersections, difference, and xor

  •    C++

The output geometry from each of these operations is guaranteed to be valid and simple as per the OGC.Documentation of any library is critical to its existance and it really takes a community of effort. All of the documentation for the library is included with the library. The Wagyu project loves pull requests so please feel free to contribute at any point in time to the docs/ directory in any way you see fit! If you see a problem in documentation, at least please make an issue in the github repository.

ray-triangle-intersection - intersect a ray and triangle in 3 dimensions

  •    Javascript

Compute the intersection of the triangle tri and a ray described by a point pt and a direction dir.tri should be an array of [x,y,z] coordinate arrays.

kld-intersections - A library of intersection algorithms covering all SVG shape types

  •    Mathematica

Below is a table listing each of the supported curve types. The Name column is the name you will need to use to refer to the shape of the given type. Arguments lists the parameters you will use to describe the shape of the given curve. It is important to note that not all combinations of names are available in the API. The current implementation supports 8 types of curves. If we count all combinations of any two curves, we end up needing 8 * 8 = 64 methods to cover all cases. And when we add Arc and Path to our list, we will need 10 * 10 = 100 methods to be written. Fortunately, the order in which we specify the curves is not important.

react-intersection-list - React infinite scroll using the Intersection <Observer /> API

  •    Javascript

Agent Smith: ...we have no choice but to continue as planned. Deploy the sentinels. Immediately. React Intersection List builds on top of React Intersection Observer, using a sentinel in the DOM to deliver a high-performance and smooth scrolling experience, even on low-end devices.

react-intersection-observer - React component for the Intersection <Observer /> API

  •    Javascript

React Intersection Observer is a React component, acting as a wrapper for the IntersectionObserver API. It is fully declarative and takes care of all the imperative parts for you.

bxh - Bounding Interval Hierarchy and Bounding Volume Hierarchy for Node.js

  •    Javascript

Bounding Interval Hierarchies (BIH) and Bounding Volume Hierarchies (BVH) are data structures that hierarchically divide a region of space in order to reduce the number of elements that must be considered when performing spatial queries. Space partitioning structures such as these help to dramatically speed up the processes of finding all the elements within a region or finding the intersection between a ray and a set of elements.

GreinerHormann - Greiner-Hormann polygon clipping algorithm

  •    Javascript

Note: If you are looking for something more powerful, take a look at the Martinez polygon clipping implementation. Input and output can be {x:x, y:y} objects or [x,y] pairs. It will output the points in the same format you put in.

martinez - Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor

  •    Javascript

The algorithm is specifically fast and capable of working with polygons of all types: multipolygons (without cascading), polygons with holes, self-intersecting polygons and degenerate polygons with overlapping edges. The algorithm of Matrinez et al. was extended to work with multipolygons without cascading.