Finding the Closest Points in a 3D Space

This tool uses the Divide and Conquer Algorithm to find the closest points in a 3D environment.

This can be used in several ways

• AI and NPC Interaction
  • Finding the closest enemy, ally, or object to a player or NPC.
  • Efficient for group behavior, like flocks, herds, or formations reacting to proximity.
• Collision Detection Optimization
  
  • Spatial partitioning with the closest pair can help pre-check likely collisions before doing expensive physics calculations
• Procedural Generation
  
  • Ensuring that objects or features are not too close together or that some are intentionally grouped.
• Gameplay Logic / Puzzles
  
  • Mechanics based on proximity or symmetry can use this to find special pairs.
• Robotics & Pathfinding
• Used in sensor data,  like LIDAR, to find objects close to each other.
• Helps in avoiding obstacles or clustering sensor points for recognition.

To use the program, enter the number of points in the space you want to generate the points. 

Move the camera around:

W: Forward

S: Backwards

A: Left

D: Right

Left Arrow: Rotate camera left

Right Arrow: Rotate camera right

Up Arrow: Camera moves up

Down Arrow: Camera moves down

Browser mode only allows 2-999 points. Download the project for the full use