the-hyp0cr1t3/sweepline-intersections the-hyp0cr1t3/sweepline-intersections

  • Stars
    star
    3
  • Rank 3,963,521 (Top 79 %)
  • Language
    C++
  • Created over 2 years ago
  • Updated over 2 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
the-hyp0cr1t3/sweepline-intersections
github

the-hyp0cr1t3

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

Given n line segments, efficiently find all points of intersection. This is a modern C++ implementation of the Bentley-Ottman algorithm from (almost) scratch because why not.

More Repositories

1

CC

Everything competitive programming related - introductory guide, topics/concepts, practice problems, snippets & templates, tips & tricks and more.
C++
931
star
2

metamorphosis

A simple implementation of the Bresenham algorithm for primitive line/circle drawing using OpenGL 3.3.
CMake
3
star
3

Codeforces-submissions

C++
2
star
4

RNA-secondary-structure-prediction

Given a nucleic acid sequence of RNA, find a maximum matching of {A,U} or {C,G} base pairs without knots or sharp turns.
C++
2
star
5

RB_tree

C
1
star
6

the-hyp0cr1t3

1
star
7

cmake-project-base

CMake Project template
CMake
1
star
8

FCFS-RR-Scheduling

Emulation and analysis of two process scheduling algorithms (FCFS and RR) for different workloads, written in C.
C
1
star