[[ 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
Rendering BSP v30 files from Halflife and it's modifications. (CSTRIKE, TFC, VALVE)
This is a 3d engine written from scratch in my last semester on the university (Spring 2009)
Build KD-Trees and perform Nearest Neighbor searches
Spatial point location using binary space partition tree
Implementation of a Binary Space Partitioning Tree
Unity one button game mechanic prototype
Dungeon generator using a BSP tree.
Bounding Volumes (BV), BV Hierachies and Spatial Partitioning w/ OctTrees + BSPTrees for Spatial Data Structures Study
dungeon generator menggunakan algoritma BSP Tree dan Revursive Backtracking
Stuff about space partitioning data structures
general programming, languages: Python, C, C++, Java
[Papers] Slides I made when I was student (french only): BSP, Law control, Principle of least action, Simulated annealing
Advanced Computer Graphics II
Understanding BSP for Procedural Level Generation
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."