C++ implementation of fortune's algorithm for voronoi diagrams.
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
#include <iostream> |
|
|
|
int main() { |
|
std::cout << "Hello, World!" << std::endl; |
|
return 0; |
|
}
|
|
|