Name		Name	Last commit message	Last commit date
.settings		.settings
bin		bin
countbenchmarks		countbenchmarks
intersectbenchmarks		intersectbenchmarks
src		src
timebenchmark		timebenchmark
.classpath		.classpath
.dropbox		.dropbox
.gitignore		.gitignore
.project		.project
2cirkels.png		2cirkels.png
GUI_executable.jar		GUI_executable.jar
README.md		README.md
Verslag.aux		Verslag.aux
Verslag.log		Verslag.log
Verslag.pdf		Verslag.pdf
Verslag.synctex.gz		Verslag.synctex.gz
Verslag.tex		Verslag.tex
cirkels.txt		cirkels.txt
codeDeBockDeCharleroy.zip		codeDeBockDeCharleroy.zip
input_1		input_1

Repository files navigation

SnijdendeCirkels

3 Algorithms to compute the intersection of a set of circles:

O(n²)
O(log(n)), worst case n²
O((n+s)log(n))

About

3 Algorithms to compute the intersection of a set of cirkels:

0 stars

1 watching

Report repository

Releases

Packages

Contributors

Languages