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.
 
 
 

19 lines
628 B

cmake_minimum_required(VERSION 3.22)
project(Voronoi_2)
set(CMAKE_CXX_STANDARD 20)
find_package(glfw3 3.3 REQUIRED)
add_executable(Voronoi_2 main.cpp src/datastructures/Beachline.cpp
src/datastructures/Beachline.h src/datastructures/DCEL.cpp
src/datastructures/DCEL.h src/types/point.h
src/types/event.h src/types/node.h
src/utils/intersection.h src/utils/circle.h glad.c src/types/shader.cpp src/types/shader.h)
include_directories(./includes)
include_directories(./src/datastructures)
include_directories(./src/types)
include_directories(./src/utils)
target_link_libraries(Voronoi_2 glfw)