Optimizing taxi dispatch with Voronoi diagrams

January 2026

A geometric take on the nearest-vehicle problem — Voronoi diagrams and a KD-tree to optimize taxi assignment, tested on a map of Subotica with several seeded simulations.

  • Python
  • NumPy
  • SciPy
  • Qhull
  • KD-Tree
  • Fortune's algorithm
  • Algorithmic complexity (O(N log N))
  • Reproducibility (seeded RNG)
  • Separation of layers (visual/computational)
Read more