Skip to content

Latest commit

 

History

History
24 lines (22 loc) · 1.2 KB

README.md

File metadata and controls

24 lines (22 loc) · 1.2 KB
Raw

Voronoi-diagram

Implementation of voronoi diagram with incremental algorithm

Description of files

  • line_intersection.py: Determine whether 2 lines intersect
  • bisector.py: Define how to create the bisector and the functions realated to it such as finding intersection
  • xygraph.py: Create the empty frame for the initial double connected edgelist
  • dcel.py:
    • Double connected edge list implemetation
    • Update new points
  • voronoid.py: Initalize the double connected edgelist and add new points
  • drawvoronoid.py: Draw the voronoi diagram
  • plot.ipynb: Import and visualize the datapoints
  • Hospital.ipynb: Extract latitudes and longitudes of hospitals from the map then visualize them with Voronoi

How to Import and Run the Algorithm

To try out this algorithm with your data points, run

from voronoid import Xygraph
from drawvoronoid import plotVoronoi

points = [(0, 1), (1, 8), (9, 0), (9, 4), (10, 10)]
plotVoronoi(points, -1, 13, -1, 11)

image