js-quadtree

import { QuadTree, Box, Point, Circle } from 'js-quadtree'; // 1. Define the bounding area for the quadtree const boundingArea = new Box(0, 0, 1000, 1000); // x, y, width, height // 2. Configure the quadtree (optional parameters) const config = { capacity: 8, // Max points per node before subdividing (default: 4) removeEmptyNodes: true, // Automatically clean up empty sub-nodes (default: false) maximumDepth: 10, // Prevent infinite subdivision, -1 for no limit (default: -1) // Custom comparison function for point removal if data is complex arePointsEqual: (p1, p2) => p1.data && p2.data && p1.data.id === p2.data.id }; // 3. Instantiate the quadtree with initial points (optional) const initialPoints = [ new Point(100, 200, { id: 'a', type: 'player' }), new Point(500, 700, { id: 'b', type: 'enemy' }), { x: 150, y: 250, data: { id: 'c', type: 'item' } } // Custom object insert, requires x/y ]; const quadtree = new QuadTree(boundingArea, config, initialPoints); console.log(`Initial quadtree has ${quadtree.length} points.`); // 4. Insert more points individually or as an array quadtree.insert(new Point(300, 400, { id: 'd', type: 'obstacle' })); quadtree.insert([ new Point(80, 120, { id: 'e', type: 'item' }), { x: 900, y: 100, data: { id: 'f', type: 'effect' } } ]); // 5. Query for objects within a specific area (e.g., a circle) const searchArea = new Circle(150, 150, 100); // centerX, centerY, radius const results = quadtree.query(searchArea); console.log(`Found ${results.length} items in the search area.`); results.forEach(point => console.log(` - Point at (${point.x}, ${point.y}) with data:`, point.data)); // 6. Remove a point const pointToRemove = new Point(100, 200, { id: 'a' }); quadtree.remove(pointToRemove); // Requires arePointsEqual config if data matters for equality console.log('Attempted to remove point (100, 200). New total points:', quadtree.length);