Displaying 1 to 20 from 43 results

A BVH implementation to speed up raycasting and enable spatial queries against three.js meshes.

threejs tree performance acceleration geometry graphics distance webvr point-cloud raycast mesh intersection bvh bounds three-js pointcloud webxr bounds-hierarchyGeometricIntersection 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.

2d 3d game-components geometry intersectionGenerate 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.

integer-compression compression encoding sse2 avx2 simd time-series inverted-index intersection compressor librarySpeed-optimized BitSet implementation for modern browsers and JavaScript engines

bitset intersection union bitmap performanceAs 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.

compression integer-compression simd-instructions simd algorithms intersectionCreates 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.

pick picking intersect intersection ray rays hit test unproject project collision mouse touch 2d 3d projection perspectiveA 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.

perspective projection rendering 3d webgl glsl stackgl gl-mat4 matrix matrices mat4 ray pick intersectionA 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].

pick picking ray camera unproject project hit test collision intersect intersection intersects mouse touchA 2d implementation of the octree traversal algorithm described in An Efficient Parametric Algorithm for Octree Traversal.

2d ray quadtree intersection geometry⚡️ Fast geometry in geometry lookup for large GeoJSONs.With this package you can perform the following operations (and more) on a given GeoJSON.

geojson lookup nodejs geojson-geometries-lookup point-lookup line-lookup polygon-lookup points-lookup lines-lookup polygons-lookup geojsons-lookup point line polygon geojsons points lines polygons intersection contains contain container containers containedCrazy fast polygon boolean operations in JS using Martinez algorithm. A work in progress.

polygon boolean geometry clipping union intersectionThe 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.

computational-geometry union intersection xor geometry difference clippingCompute 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.

3d ray intersect intersection triangle collision collideBelow 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.

svg intersections kld-intersections bezier-curve circle rectangle line polyline polygon ellipse intersection bezier pathAgent 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.

infinite-scroll list intersection-observer react intersection observer component infinite scrollable researchgateReact 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.

react intersection-observer viewport impressions scrolling intersection observer component visible invisible researchgateBounding 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.

bvh bih 3d 2d bounding volume interval hierarchy spatial acceleration intersection searchNote: 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.

polygon clipping intersection leaflet greiner hormann leaflet-plugin maps
We have large collection of open source products. Follow the tags from
Tag Cloud >>

Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
**Add Projects.**