Computational topology draws on many constructs from computational geometry,
a closely allied area whose focus is designing and implementing algorithms to solve
geometric problems. In particular, for problems such as surface reconstruction or
topological data analysis, we often use the classic computational geometry construction of
a Voronoi diagrams (and its dual, the Delaunay triangulations). In this lecture, we will
introduce these constructs and their uses. No prior algorithms or computational geometry
expertise is needed.