This projects goal is to implement the Fortune triangulation algorithm in Lazarus as efficiently as possible. Both the beach front and the events priority queue are organized as balanced binary trees. The beach front deletion is non-recursive so that no parabola intersections occur during a point deletion. Timing on a relatively fast windows PC: one million points in about 3 seconds.
-
Notifications
You must be signed in to change notification settings - Fork 0
YulBEdwards/Lazarus-Fortune-voronoi-with-binary-tree
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This project’s goal was to re-implement in Lazarus the companion python Voronoi calculation.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published