Skip to main content

08F. Misc

Less than 1 minuteCppcrashcoursecppc-plus-plusalgorithm

08F. Misc ๊ด€๋ จ

Finding the nearest pair of points

Algorithms for Competitive Programming > Finding the nearest pair of points
Finding the nearest pair of points

Delaunay triangulation and Voronoi diagram

Algorithms for Competitive Programming > Delaunay triangulation and Voronoi diagram
Delaunay triangulation and Voronoi diagram

Vertical decomposition

Algorithms for Competitive Programming > Vertical decomposition
Vertical decomposition

Half-plane intersection - S&I Algorithm in O(N log N)

Algorithms for Competitive Programming > Half-plane intersection - S&I Algorithm in O(N log N)
Half-plane intersection - S&I Algorithm in O(N log N)