[[ ARCHIVED ]] gann(go-approximate-nearest-neighbor) is a library for Approximate Nearest Neighbor Search written in Go
-
Updated
Sep 15, 2020 - Go
[[ ARCHIVED ]] gann(go-approximate-nearest-neighbor) is a library for Approximate Nearest Neighbor Search written in Go
This is a 3d engine written from scratch in my last semester on the university (Spring 2009)
Rendering BSP v30 files from Halflife and it's modifications. (CSTRIKE, TFC, VALVE)
A collection of space partitioning trees for Rust 🦀
A Python wrapper for the lightning fast fast3tree library, a BSP tree implementation written by Peter Behroozi.
Implementation of a Binary Space Partitioning Tree
Spatial point location using binary space partition tree
Build KD-Trees and perform Nearest Neighbor searches
general programming, languages: Python, C, C++, Java
dungeon generator menggunakan algoritma BSP Tree dan Revursive Backtracking
Java implementation of Binary Space Partitions
Unity one button game mechanic prototype
Stuff about space partitioning data structures
Dungeon generator using a BSP tree.
Understanding BSP for Procedural Level Generation
Bounding Volumes (BV), BV Hierachies and Spatial Partitioning w/ OctTrees + BSPTrees for Spatial Data Structures Study
Add a description, image, and links to the bsp-tree topic page so that developers can more easily learn about it.
To associate your repository with the bsp-tree topic, visit your repo's landing page and select "manage topics."