Geometric algorithms

Sweep line algorithm

In computational geometry, a sweep line algorithm or plane sweep algorithm is an algorithmic paradigm that uses a conceptual sweep line or sweep surface to solve various problems in Euclidean space. It is one of the key techniques in computational geometry. The idea behind algorithms of this type is to imagine that a line (often a vertical line) is swept or moved across the plane, stopping at some points. Geometric operations are restricted to geometric objects that either intersect or are in the immediate vicinity of the sweep line whenever it stops, and the complete solution is available once the line has passed over all objects. (Wikipedia).

Sweep line algorithm
Video thumbnail

Discrete Math - 3.1.3 Sorting Algorithms

Bubble sort and insertion sort algorithms. Textbook: Rosen, Discrete Mathematics and Its Applications, 7e Playlist: https://www.youtube.com/playlist?list=PLl-gb0E4MII28GykmtuBXNUNoej-vY5Rz

From playlist Discrete Math I (Entire Course)

Video thumbnail

Merge Sort 1 – The Algorithm

This is the first in a series of videos about the merge sort. It describes the principle of the merge sort algorithm, which takes a ‘divide and conquer’ approach to the problem of sorting and unordered list. The videos that follow build on these principles, leading towards a recursive im

From playlist Sorting Algorithms

Video thumbnail

Heap Sort - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.

From playlist Introduction to Algorithms

Video thumbnail

C Programming: Sorting and searching arrays of structs

In this session we learn how to sort an array of structs, then search it using the built-in binary search (bsearch) function.

From playlist C Programming

Video thumbnail

Discrete Math - 3.1.2 Searching Algorithms

Linear search and binary search algorithms. Textbook: Rosen, Discrete Mathematics and Its Applications, 7e Playlist: https://www.youtube.com/playlist?list=PLl-gb0E4MII28GykmtuBXNUNoej-vY5Rz

From playlist Discrete Math I (Entire Course)

Video thumbnail

Erin Chambers (2/5/19): Computing optimal homotopies

Abstract: The question of how to measure similarity between curves in various settings has received much attention recently, motivated by applications in GIS data analysis, medical imaging, and computer graphics. Geometric measures such as Hausdorff and Fr\'echet distance have efficient al

From playlist AATRN 2019

Video thumbnail

Quicksort 4 – VB.NET Implementation

This video describes a recursive VB.NET implementation of a quicksort. It follows on from previous quicksort videos that covered algorithms for partitioning a list, and pseudocode for a program that calls itself recursively to process successively smaller partitions, until the original li

From playlist Sorting Algorithms

Video thumbnail

Erin Wolf Chambers (5/12/22): Computing optimal homotopies

The question of how to measure similarity between curves in various settings has received much attention recently, motivated by applications in GIS data analysis, medical imaging, and computer graphics. Geometric measures such as Hausdorff and Fr\'echet distance have efficient algorithms,

From playlist Bridging Applied and Quantitative Topology 2022

Video thumbnail

Find the Shortest Path - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.

From playlist Introduction to Algorithms

Video thumbnail

Recitation 8: Simulation Algorithms

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Victor Costan License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

From playlist MIT 6.006 Introduction to Algorithms, Fall 2011

Video thumbnail

RubyConf 2016 - Methods of Memory Management in MRI by Aaron Patterson

RubyConf 2016 - Methods of Memory Management in MRI by Aaron Patterson Let's talk about MRI's GC! In this talk we will cover memory management algorithms in MRI. We will cover how objects are allocated and how they are freed. We will start by looking at Ruby's memory layout, including pag

From playlist RubyConf 2016

Video thumbnail

Insertion Sort Algorithm

This is the first of two videos about the insertion sort. This video describes the insertion sort algorithm. The insertion sort is rather like sorting a hand of playing cards. The insertion sort is particularly good for lists that are nearly sorted already, or when you just want to inse

From playlist Sorting Algorithms

Video thumbnail

Visualizing Problems from a Geometrical Point of View - P1. Winning Criteria

An explanation of the problem "Winning Criteria" or P1 from the series "Visualizing Problems from a Geometrical Point of View". Link: https://visualizing-problems-geo.vercel.app/ Music Credits: Local Forecast - Slower by Kevin MacLeod Link: https://incompetech.filmmusic.io/song/3988-loca

From playlist Summer of Math Exposition Youtube Videos

Video thumbnail

GoRuCo 2013 - To Know A Garbage Collector by Mike Bernstein

It started as an obsession with making the web application used at my day job faster, and ended with trying to implement new Garbage Collection algorithms in a notoriously insane codebase. Garbage collection is an epic hack and a triumphant abstraction that supports various programming par

From playlist GoRuCo 2013

Video thumbnail

A Quantum Monte Carlo Study of the Critical Phase in the Square Lattice Quantum...by Sreejit G J

PROGRAM FRUSTRATED METALS AND INSULATORS (HYBRID) ORGANIZERS Federico Becca (University of Trieste, Italy), Subhro Bhattacharjee (ICTS-TIFR, India), Yasir Iqbal (IIT Madras, India), Bella Lake (Helmholtz-Zentrum Berlin für Materialien und Energie, Germany), Yogesh Singh (IISER Mohali, In

From playlist FRUSTRATED METALS AND INSULATORS (HYBRID, 2022)

Video thumbnail

Building Collision Simulations: An Introduction to Computer Graphics

Collision detection systems show up in all sorts of video games and simulations. But how do you actually build these systems? Turns out that the key ideas behind these systems show up all over a field of computer science called computer graphics. We start off with the basics of animation

From playlist Computer Graphics

Video thumbnail

RubyConf 2015 - The Hitchhiker's Guide to Ruby GC by Eric Weinstein

The Hitchhiker's Guide to Ruby GC by Eric Weinstein When Ruby programs slow down, the usual culprits—database queries, superlinear time complexity—aren't always the real problem. Ruby's object space and garbage collection are a surprisingly rich and oft-misunderstood area of the language

From playlist RubyConf 2015

Video thumbnail

Lecture 07: Planning and Learning with Tabular Methods

Seventh lecture video on the course "Reinforcement Learning" at Paderborn University during the summer term 2020. Source files are available here: https://github.com/upb-lea/reinforcement_learning_course_materials

From playlist Reinforcement Learning Course: Lectures (Summer 2020)

Related pages

Big O notation | Self-balancing binary search tree | Computational geometry | Rotating calipers | Algorithmic paradigm | Voronoi diagram | Euclidean space | Bentley–Ottmann algorithm | Analysis of algorithms | Delaunay triangulation | Fortune's algorithm | Boolean operations on polygons