Carleton University - School of Computer Science Honours Project
Summer 2020
Low-poly Video Approximation using Delaunay Tetrahedralization
Andrew Burry
SCS Honours Project Image
ABSTRACT
The goal of this project was to address the issue of frame coherence and flickering when algorithmically creating low-polygon abstractions of video footage. The ideal solution would result in high levels of abstraction through use of large triangles while still retaining enough information to accurately resolve the image. This problem would be solved by creating a python framework which could create low-polygon approximations of video footage based on a specified point-placement module. To create a low-polygon approximation, the framework would utilise Delaunay tetrahedralization to tesselate a three-dimensional point set into a set of tetrahedra. The placement of points is extremely important to maintain resolution of the abstraction. In order to achieve the desired results, several point-placement modules would be designed and investigated. The best results were achieved through the use of feature detection and filtering techniques. This module solved the issue of frame coherence and flickering while maintaining high levels of abstraction. The final results can be observed in the accompanying video files.