Displaying 1 to 19 from 19 results

XNA Quad Tree

  •    

Source files for an XNA Quad Tree. Note that this code will not compile until you implement some of the classes that are referenced.

go-rquad - State of the art point location and neighbour finding algorithms for region quadtrees, in Go

  •    Go

Go-rquad proposes various implementations of region quadtrees.A region quadtree is a special kind of quadtree that recursively subdivides a 2 dimensional space into 4 smaller and generally equal rectangular regions, until the wanted quadtree resolution has been reached, or no further subdivisions can be performed.

d3-quadtree - Two-dimensional recursive spatial subdivision.

  •    Javascript

Two-dimensional recursive spatial subdivision.

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.




boxtree - Quad/octree building for FMMs in Python and OpenCL

  •    Python

boxtree is a package that, given some point locations in two or three dimensions, sorts them into an adaptive quad/octree of boxes, efficiently, in parallel, using PyOpenCL. It can also generate traversal lists needed for adaptive fast multipole methods and related algorithms and tree-based look-up tables for geometric proximity.

Quadtree - Quadtree implementation

  •    Java

This is a Java implementation of Quadtree, a tree data structure useful to store 2D positional data.

quadtreevis - An interactive visualization that shows how D3's quadtree works.

  •    Javascript

Demonstrates the connection between a D3 quadtree's internals and the quads and points it describes.

node-quadtree - geospatial quadtree encoding and decoding node module

  •    Javascript

Quadtree is a node module that encodes and decodes geospatial quadtrees. Encodes a coordinate into a quadtree of the specified precision.


yaot - Yet another octree

  •    Javascript

You can also query points which lies inside octants intersected by a ray. This is very useful when you want to know which points lie under mouse cursor. To see how to use it with three.js please read about demo below.

erlquad - Simple quadtrees

  •    Erlang

Authors: Guilherme Andrade (erlquad(at)gandrade(dot)net). erlquad is a straightforward Erlang implementation of quadtrees, supporting both bounding-box outlines as well as precise coordinates for small enough objects.

quadtree-lib - Efficient quadtrees library written in CoffeeScript.

  •    CoffeeScript

If you are already familiar with quadtrees, then you should perfectly understand how to use this library. Otherwise, there are many online articles (wikipedia does the job) which explain the advantages of using the quadtree datastructure in certain situations.

aoi - 基于 QuadTree ,实现的AOI。将用在NavMeshScene中,做Agent间的碰撞

  •    C++

基于 QuadTree ,实现的AOI。将用在NavMeshScene中,做Agent间的碰撞

go-rquad - State of the art point location and neighbour finding algorithms for region quadtrees, in Go

  •    Go

Go-rquad proposes various implementations of region quadtrees. A region quadtree is a special kind of quadtree that recursively subdivides a 2 dimensional space into 4 smaller and generally equal rectangular regions, until the wanted quadtree resolution has been reached, or no further subdivisions can be performed.

Advanced-Algorithms - 100+ algorithms & data structures generically implemented in C#.

  •    CSharp

Please don't take effort to create pull requests for new algorithms/data structures. This is just a curiosity driven personal hobby and was originally not intented to be a library. Feel free fork and modify to fit your need if that's what you are looking for. You can however open issues/fix bugs with pull requests here, I would be happy to take a look when I get time. Various important computer science algorithms generically implemented in C#.

ngraph.quadtreebh3d - OctTree data structure for Barnes-Hut simulation in 3d space

  •    Javascript

Note: This project was superceded by https://github.com/anvaka/ngraph.forcelayout. You can still use it as a reference for your own understanding of oct-trees, but ngraph.forcelayout contains more efficient implementation that can work for arbitrary number of dimensions. Quad Tree data structure for Barnes-Hut simulation in 3d space. Technically it should be named OctTree, since it's not a quad tree. But for parity with 2d interface it's currently called quadtree. Let me know if you think it should be changed :).






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.