Skip to content

Latest commit

 

History

History
12 lines (9 loc) · 556 Bytes

README.md

File metadata and controls

12 lines (9 loc) · 556 Bytes

Algorithmisation of Geometrical Problems - VŠB-TUO

Visualization of algorithms studied in Technical university of Ostrava in lectures of subject Algorithmisation of Geometrical Problems.

Items:

  • Point in Polygon test
  • Convex hull - Jarvis march
  • Closest pair of points in 1D
  • Closest pair of points in 2D

All algorithms are visualised and uploaded on YouTube.

Web site: www.vsb.cz and mrl.cs.vsb.cz